TSTP Solution File: SYN077+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN077+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 1 03:05:10 EDT 2023
% Result : Theorem 1.56s 0.98s
% Output : CNFRefutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 6 unt; 0 def)
% Number of atoms : 180 ( 14 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 226 ( 90 ~; 80 |; 41 &)
% ( 6 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 127 ( 0 sgn; 63 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
? [X1] :
! [X2] :
( big_f(X2,X1)
<=> X0 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel54_1) ).
fof(f2,conjecture,
~ ? [X3] :
! [X2] :
( big_f(X2,X3)
<=> ! [X4] :
( big_f(X2,X4)
=> ? [X0] :
( ~ ? [X1] :
( big_f(X1,X0)
& big_f(X1,X4) )
& big_f(X0,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel54) ).
fof(f3,negated_conjecture,
~ ~ ? [X3] :
! [X2] :
( big_f(X2,X3)
<=> ! [X4] :
( big_f(X2,X4)
=> ? [X0] :
( ~ ? [X1] :
( big_f(X1,X0)
& big_f(X1,X4) )
& big_f(X0,X4) ) ) ),
inference(negated_conjecture,[],[f2]) ).
fof(f4,plain,
~ ~ ? [X0] :
! [X1] :
( big_f(X1,X0)
<=> ! [X2] :
( big_f(X1,X2)
=> ? [X3] :
( ~ ? [X4] :
( big_f(X4,X3)
& big_f(X4,X2) )
& big_f(X3,X2) ) ) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
? [X0] :
! [X1] :
( big_f(X1,X0)
<=> ! [X2] :
( big_f(X1,X2)
=> ? [X3] :
( ~ ? [X4] :
( big_f(X4,X3)
& big_f(X4,X2) )
& big_f(X3,X2) ) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
? [X0] :
! [X1] :
( big_f(X1,X0)
<=> ! [X2] :
( ? [X3] :
( ! [X4] :
( ~ big_f(X4,X3)
| ~ big_f(X4,X2) )
& big_f(X3,X2) )
| ~ big_f(X1,X2) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f7,plain,
! [X0] :
? [X1] :
! [X2] :
( ( big_f(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ big_f(X2,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f8,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( big_f(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ big_f(X2,X1) ) )
=> ! [X2] :
( ( big_f(X2,sK0(X0))
| X0 != X2 )
& ( X0 = X2
| ~ big_f(X2,sK0(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X0,X2] :
( ( big_f(X2,sK0(X0))
| X0 != X2 )
& ( X0 = X2
| ~ big_f(X2,sK0(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
fof(f10,plain,
? [X0] :
! [X1] :
( ( big_f(X1,X0)
| ? [X2] :
( ! [X3] :
( ? [X4] :
( big_f(X4,X3)
& big_f(X4,X2) )
| ~ big_f(X3,X2) )
& big_f(X1,X2) ) )
& ( ! [X2] :
( ? [X3] :
( ! [X4] :
( ~ big_f(X4,X3)
| ~ big_f(X4,X2) )
& big_f(X3,X2) )
| ~ big_f(X1,X2) )
| ~ big_f(X1,X0) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f11,plain,
? [X0] :
! [X1] :
( ( big_f(X1,X0)
| ? [X2] :
( ! [X3] :
( ? [X4] :
( big_f(X4,X3)
& big_f(X4,X2) )
| ~ big_f(X3,X2) )
& big_f(X1,X2) ) )
& ( ! [X5] :
( ? [X6] :
( ! [X7] :
( ~ big_f(X7,X6)
| ~ big_f(X7,X5) )
& big_f(X6,X5) )
| ~ big_f(X1,X5) )
| ~ big_f(X1,X0) ) ),
inference(rectify,[],[f10]) ).
fof(f12,plain,
( ? [X0] :
! [X1] :
( ( big_f(X1,X0)
| ? [X2] :
( ! [X3] :
( ? [X4] :
( big_f(X4,X3)
& big_f(X4,X2) )
| ~ big_f(X3,X2) )
& big_f(X1,X2) ) )
& ( ! [X5] :
( ? [X6] :
( ! [X7] :
( ~ big_f(X7,X6)
| ~ big_f(X7,X5) )
& big_f(X6,X5) )
| ~ big_f(X1,X5) )
| ~ big_f(X1,X0) ) )
=> ! [X1] :
( ( big_f(X1,sK1)
| ? [X2] :
( ! [X3] :
( ? [X4] :
( big_f(X4,X3)
& big_f(X4,X2) )
| ~ big_f(X3,X2) )
& big_f(X1,X2) ) )
& ( ! [X5] :
( ? [X6] :
( ! [X7] :
( ~ big_f(X7,X6)
| ~ big_f(X7,X5) )
& big_f(X6,X5) )
| ~ big_f(X1,X5) )
| ~ big_f(X1,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X1] :
( ? [X2] :
( ! [X3] :
( ? [X4] :
( big_f(X4,X3)
& big_f(X4,X2) )
| ~ big_f(X3,X2) )
& big_f(X1,X2) )
=> ( ! [X3] :
( ? [X4] :
( big_f(X4,X3)
& big_f(X4,sK2(X1)) )
| ~ big_f(X3,sK2(X1)) )
& big_f(X1,sK2(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X1,X3] :
( ? [X4] :
( big_f(X4,X3)
& big_f(X4,sK2(X1)) )
=> ( big_f(sK3(X1,X3),X3)
& big_f(sK3(X1,X3),sK2(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X5] :
( ? [X6] :
( ! [X7] :
( ~ big_f(X7,X6)
| ~ big_f(X7,X5) )
& big_f(X6,X5) )
=> ( ! [X7] :
( ~ big_f(X7,sK4(X5))
| ~ big_f(X7,X5) )
& big_f(sK4(X5),X5) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X1] :
( ( big_f(X1,sK1)
| ( ! [X3] :
( ( big_f(sK3(X1,X3),X3)
& big_f(sK3(X1,X3),sK2(X1)) )
| ~ big_f(X3,sK2(X1)) )
& big_f(X1,sK2(X1)) ) )
& ( ! [X5] :
( ( ! [X7] :
( ~ big_f(X7,sK4(X5))
| ~ big_f(X7,X5) )
& big_f(sK4(X5),X5) )
| ~ big_f(X1,X5) )
| ~ big_f(X1,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f11,f15,f14,f13,f12]) ).
fof(f17,plain,
! [X2,X0] :
( X0 = X2
| ~ big_f(X2,sK0(X0)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
! [X2,X0] :
( big_f(X2,sK0(X0))
| X0 != X2 ),
inference(cnf_transformation,[],[f9]) ).
fof(f19,plain,
! [X1,X5] :
( big_f(sK4(X5),X5)
| ~ big_f(X1,X5)
| ~ big_f(X1,sK1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f20,plain,
! [X1,X7,X5] :
( ~ big_f(X7,sK4(X5))
| ~ big_f(X7,X5)
| ~ big_f(X1,X5)
| ~ big_f(X1,sK1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f21,plain,
! [X1] :
( big_f(X1,sK1)
| big_f(X1,sK2(X1)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f22,plain,
! [X3,X1] :
( big_f(X1,sK1)
| big_f(sK3(X1,X3),sK2(X1))
| ~ big_f(X3,sK2(X1)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
! [X3,X1] :
( big_f(X1,sK1)
| big_f(sK3(X1,X3),X3)
| ~ big_f(X3,sK2(X1)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X2] : big_f(X2,sK0(X2)),
inference(equality_resolution,[],[f18]) ).
cnf(c_49,plain,
big_f(X0,sK0(X0)),
inference(cnf_transformation,[],[f24]) ).
cnf(c_50,plain,
( ~ big_f(X0,sK0(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_51,negated_conjecture,
( ~ big_f(X0,sK2(X1))
| big_f(sK3(X1,X0),X0)
| big_f(X1,sK1) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_52,negated_conjecture,
( ~ big_f(X0,sK2(X1))
| big_f(sK3(X1,X0),sK2(X1))
| big_f(X1,sK1) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_53,negated_conjecture,
( big_f(X0,sK2(X0))
| big_f(X0,sK1) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_54,negated_conjecture,
( ~ big_f(X0,sK4(X1))
| ~ big_f(X0,X1)
| ~ big_f(X2,X1)
| ~ big_f(X2,sK1) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_55,negated_conjecture,
( ~ big_f(X0,X1)
| ~ big_f(X0,sK1)
| big_f(sK4(X1),X1) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_56,plain,
big_f(sK1,sK0(sK1)),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_288,plain,
( ~ big_f(sK3(X0,sK4(X1)),X1)
| ~ big_f(sK4(X1),sK2(X0))
| ~ big_f(X2,X1)
| ~ big_f(X2,sK1)
| big_f(X0,sK1) ),
inference(superposition,[status(thm)],[c_51,c_54]) ).
cnf(c_333,plain,
( ~ big_f(sK4(sK2(X0)),sK2(X0))
| ~ big_f(X1,sK2(X0))
| ~ big_f(X1,sK1)
| big_f(X0,sK1) ),
inference(superposition,[status(thm)],[c_52,c_288]) ).
cnf(c_338,plain,
( ~ big_f(X0,sK1)
| big_f(sK4(sK0(X0)),sK0(X0)) ),
inference(superposition,[status(thm)],[c_49,c_55]) ).
cnf(c_356,plain,
( ~ big_f(X0,sK1)
| sK4(sK0(X0)) = X0 ),
inference(superposition,[status(thm)],[c_338,c_50]) ).
cnf(c_445,plain,
( ~ big_f(X0,sK2(X1))
| ~ big_f(X0,sK1)
| big_f(X1,sK1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_333,c_55]) ).
cnf(c_450,plain,
( ~ big_f(sK3(X0,X1),sK1)
| ~ big_f(X1,sK2(X0))
| big_f(X0,sK1) ),
inference(superposition,[status(thm)],[c_52,c_445]) ).
cnf(c_489,plain,
( ~ big_f(sK1,sK2(X0))
| big_f(X0,sK1) ),
inference(superposition,[status(thm)],[c_51,c_450]) ).
cnf(c_497,plain,
big_f(sK1,sK1),
inference(superposition,[status(thm)],[c_53,c_489]) ).
cnf(c_498,plain,
sK4(sK0(sK1)) = sK1,
inference(superposition,[status(thm)],[c_497,c_356]) ).
cnf(c_546,plain,
( ~ big_f(X0,sK0(sK1))
| ~ big_f(X1,sK0(sK1))
| ~ big_f(X0,sK1)
| ~ big_f(X1,sK1) ),
inference(superposition,[status(thm)],[c_498,c_54]) ).
cnf(c_558,plain,
( ~ big_f(sK1,sK0(sK1))
| ~ big_f(sK1,sK1) ),
inference(instantiation,[status(thm)],[c_546]) ).
cnf(c_559,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_558,c_497,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SYN077+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.09 % Command : run_iprover %s %d THM
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Sat Aug 26 20:53:14 EDT 2023
% 0.08/0.27 % CPUTime :
% 0.12/0.35 Running first-order theorem proving
% 0.12/0.35 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.56/0.98 % SZS status Started for theBenchmark.p
% 1.56/0.98 % SZS status Theorem for theBenchmark.p
% 1.56/0.98
% 1.56/0.98 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.56/0.98
% 1.56/0.98 ------ iProver source info
% 1.56/0.98
% 1.56/0.98 git: date: 2023-05-31 18:12:56 +0000
% 1.56/0.98 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.56/0.98 git: non_committed_changes: false
% 1.56/0.98 git: last_make_outside_of_git: false
% 1.56/0.98
% 1.56/0.98 ------ Parsing...
% 1.56/0.98 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.56/0.98
% 1.56/0.98 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.56/0.98
% 1.56/0.98 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.56/0.98
% 1.56/0.98 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.56/0.98 ------ Proving...
% 1.56/0.98 ------ Problem Properties
% 1.56/0.98
% 1.56/0.98
% 1.56/0.98 clauses 7
% 1.56/0.98 conjectures 5
% 1.56/0.98 EPR 0
% 1.56/0.98 Horn 4
% 1.56/0.98 unary 1
% 1.56/0.98 binary 2
% 1.56/0.98 lits 18
% 1.56/0.98 lits eq 1
% 1.56/0.98 fd_pure 0
% 1.56/0.98 fd_pseudo 0
% 1.56/0.98 fd_cond 0
% 1.56/0.98 fd_pseudo_cond 1
% 1.56/0.98 AC symbols 0
% 1.56/0.98
% 1.56/0.98 ------ Schedule dynamic 5 is on
% 1.56/0.98
% 1.56/0.98 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.56/0.98
% 1.56/0.98
% 1.56/0.98 ------
% 1.56/0.98 Current options:
% 1.56/0.98 ------
% 1.56/0.98
% 1.56/0.98
% 1.56/0.98
% 1.56/0.98
% 1.56/0.98 ------ Proving...
% 1.56/0.98
% 1.56/0.98
% 1.56/0.98 % SZS status Theorem for theBenchmark.p
% 1.56/0.98
% 1.56/0.98 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.56/0.98
% 1.56/0.99
%------------------------------------------------------------------------------