TSTP Solution File: SYN349+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN349+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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 May 3 03:30:14 EDT 2024
% Result : Theorem 1.74s 1.10s
% Output : CNFRefutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 39 ( 1 unt; 0 def)
% Number of atoms : 293 ( 0 equ)
% Maximal formula atoms : 52 ( 7 avg)
% Number of connectives : 392 ( 138 ~; 174 |; 64 &)
% ( 11 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn 29 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0] :
! [X1] :
? [X2] :
! [X3] :
( ( big_f(X0,X3)
<=> big_f(X1,X3) )
=> ( ( ( big_f(X0,X3)
<=> big_f(X3,X2) )
<=> big_f(X2,X3) )
<=> big_f(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_17_5) ).
fof(f2,negated_conjecture,
~ ? [X0] :
! [X1] :
? [X2] :
! [X3] :
( ( big_f(X0,X3)
<=> big_f(X1,X3) )
=> ( ( ( big_f(X0,X3)
<=> big_f(X3,X2) )
<=> big_f(X2,X3) )
<=> big_f(X3,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ( ( big_f(X0,X3)
<=> big_f(X3,X2) )
<=> big_f(X2,X3) )
<~> big_f(X3,X1) )
& ( big_f(X0,X3)
<=> big_f(X1,X3) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ~ big_f(X3,X1)
| ( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) )
& ( big_f(X2,X3)
| ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) ) ) ) )
& ( big_f(X3,X1)
| ( ( ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) )
| ~ big_f(X2,X3) )
& ( big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) ) ) )
& ( big_f(X0,X3)
| ~ big_f(X1,X3) )
& ( big_f(X1,X3)
| ~ big_f(X0,X3) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ~ big_f(X3,X1)
| ( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) )
& ( big_f(X2,X3)
| ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) ) ) ) )
& ( big_f(X3,X1)
| ( ( ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) )
| ~ big_f(X2,X3) )
& ( big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) ) ) )
& ( big_f(X0,X3)
| ~ big_f(X1,X3) )
& ( big_f(X1,X3)
| ~ big_f(X0,X3) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
! [X0] :
( ? [X1] :
! [X2] :
? [X3] :
( ( ~ big_f(X3,X1)
| ( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) )
& ( big_f(X2,X3)
| ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) ) ) ) )
& ( big_f(X3,X1)
| ( ( ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) )
| ~ big_f(X2,X3) )
& ( big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) ) ) )
& ( big_f(X0,X3)
| ~ big_f(X1,X3) )
& ( big_f(X1,X3)
| ~ big_f(X0,X3) ) )
=> ! [X2] :
? [X3] :
( ( ~ big_f(X3,sK0(X0))
| ( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) )
& ( big_f(X2,X3)
| ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) ) ) ) )
& ( big_f(X3,sK0(X0))
| ( ( ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) )
| ~ big_f(X2,X3) )
& ( big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) ) ) )
& ( big_f(X0,X3)
| ~ big_f(sK0(X0),X3) )
& ( big_f(sK0(X0),X3)
| ~ big_f(X0,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
! [X0,X2] :
( ? [X3] :
( ( ~ big_f(X3,sK0(X0))
| ( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) )
& ( big_f(X2,X3)
| ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) ) ) ) )
& ( big_f(X3,sK0(X0))
| ( ( ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) )
| ~ big_f(X2,X3) )
& ( big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) ) ) )
& ( big_f(X0,X3)
| ~ big_f(sK0(X0),X3) )
& ( big_f(sK0(X0),X3)
| ~ big_f(X0,X3) ) )
=> ( ( ~ big_f(sK1(X0,X2),sK0(X0))
| ( ( ~ big_f(X2,sK1(X0,X2))
| ( ( ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(sK1(X0,X2),X2)
| big_f(X0,sK1(X0,X2)) ) ) )
& ( big_f(X2,sK1(X0,X2))
| ( ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ) ) ) ) )
& ( big_f(sK1(X0,X2),sK0(X0))
| ( ( ( ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ) )
| ~ big_f(X2,sK1(X0,X2)) )
& ( big_f(X2,sK1(X0,X2))
| ( ( ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(sK1(X0,X2),X2)
| big_f(X0,sK1(X0,X2)) ) ) ) ) )
& ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK0(X0),sK1(X0,X2)) )
& ( big_f(sK0(X0),sK1(X0,X2))
| ~ big_f(X0,sK1(X0,X2)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X0,X2] :
( ( ~ big_f(sK1(X0,X2),sK0(X0))
| ( ( ~ big_f(X2,sK1(X0,X2))
| ( ( ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(sK1(X0,X2),X2)
| big_f(X0,sK1(X0,X2)) ) ) )
& ( big_f(X2,sK1(X0,X2))
| ( ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ) ) ) ) )
& ( big_f(sK1(X0,X2),sK0(X0))
| ( ( ( ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ) )
| ~ big_f(X2,sK1(X0,X2)) )
& ( big_f(X2,sK1(X0,X2))
| ( ( ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(sK1(X0,X2),X2)
| big_f(X0,sK1(X0,X2)) ) ) ) ) )
& ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK0(X0),sK1(X0,X2)) )
& ( big_f(sK0(X0),sK1(X0,X2))
| ~ big_f(X0,sK1(X0,X2)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f7,f6]) ).
fof(f9,plain,
! [X2,X0] :
( big_f(sK0(X0),sK1(X0,X2))
| ~ big_f(X0,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X2,X0] :
( big_f(X0,sK1(X0,X2))
| ~ big_f(sK0(X0),sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X2,X0] :
( big_f(sK1(X0,X2),sK0(X0))
| big_f(X2,sK1(X0,X2))
| big_f(sK1(X0,X2),X2)
| big_f(X0,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X2,X0] :
( big_f(sK1(X0,X2),sK0(X0))
| big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2))
| ~ big_f(X2,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
! [X2,X0] :
( ~ big_f(sK1(X0,X2),sK0(X0))
| big_f(X2,sK1(X0,X2))
| big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f18,plain,
! [X2,X0] :
( ~ big_f(sK1(X0,X2),sK0(X0))
| ~ big_f(X2,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
( ~ big_f(sK1(X0,X1),sK0(X0))
| ~ big_f(sK1(X0,X1),X1)
| ~ big_f(X0,sK1(X0,X1))
| ~ big_f(X1,sK1(X0,X1)) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_51,negated_conjecture,
( ~ big_f(sK1(X0,X1),sK0(X0))
| ~ big_f(sK1(X0,X1),X1)
| big_f(X0,sK1(X0,X1))
| big_f(X1,sK1(X0,X1)) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_54,negated_conjecture,
( ~ big_f(X0,sK1(X0,X1))
| ~ big_f(X1,sK1(X0,X1))
| big_f(sK1(X0,X1),sK0(X0))
| big_f(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_56,negated_conjecture,
( big_f(sK1(X0,X1),sK0(X0))
| big_f(sK1(X0,X1),X1)
| big_f(X0,sK1(X0,X1))
| big_f(X1,sK1(X0,X1)) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_57,negated_conjecture,
( ~ big_f(sK0(X0),sK1(X0,X1))
| big_f(X0,sK1(X0,X1)) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_58,negated_conjecture,
( ~ big_f(X0,sK1(X0,X1))
| big_f(sK0(X0),sK1(X0,X1)) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_153,negated_conjecture,
( ~ big_f(X0,sK1(X0,X1))
| big_f(sK0(X0),sK1(X0,X1)) ),
inference(demodulation,[status(thm)],[c_58]) ).
cnf(c_154,negated_conjecture,
( ~ big_f(sK0(X0),sK1(X0,X1))
| big_f(X0,sK1(X0,X1)) ),
inference(demodulation,[status(thm)],[c_57]) ).
cnf(c_155,negated_conjecture,
( big_f(sK1(X0,X1),sK0(X0))
| big_f(sK1(X0,X1),X1)
| big_f(X0,sK1(X0,X1))
| big_f(X1,sK1(X0,X1)) ),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_157,negated_conjecture,
( ~ big_f(X0,sK1(X0,X1))
| ~ big_f(X1,sK1(X0,X1))
| big_f(sK1(X0,X1),sK0(X0))
| big_f(sK1(X0,X1),X1) ),
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_160,negated_conjecture,
( ~ big_f(sK1(X0,X1),sK0(X0))
| ~ big_f(sK1(X0,X1),X1)
| big_f(X0,sK1(X0,X1))
| big_f(X1,sK1(X0,X1)) ),
inference(demodulation,[status(thm)],[c_51]) ).
cnf(c_162,negated_conjecture,
( ~ big_f(sK1(X0,X1),sK0(X0))
| ~ big_f(sK1(X0,X1),X1)
| ~ big_f(X0,sK1(X0,X1))
| ~ big_f(X1,sK1(X0,X1)) ),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_163,plain,
( ~ big_f(sK1(X0,sK0(X0)),sK0(X0))
| ~ big_f(sK0(X0),sK1(X0,sK0(X0)))
| ~ big_f(X0,sK1(X0,sK0(X0))) ),
inference(instantiation,[status(thm)],[c_162]) ).
cnf(c_164,plain,
( ~ big_f(sK0(X0),sK1(X0,sK0(X0)))
| ~ big_f(X0,sK1(X0,sK0(X0)))
| big_f(sK1(X0,sK0(X0)),sK0(X0)) ),
inference(instantiation,[status(thm)],[c_157]) ).
cnf(c_165,plain,
( ~ big_f(sK1(iProver_bot,sK0(iProver_bot)),sK0(iProver_bot))
| ~ big_f(sK0(iProver_bot),sK1(iProver_bot,sK0(iProver_bot)))
| ~ big_f(iProver_bot,sK1(iProver_bot,sK0(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_163]) ).
cnf(c_166,plain,
( ~ big_f(sK0(iProver_bot),sK1(iProver_bot,sK0(iProver_bot)))
| ~ big_f(iProver_bot,sK1(iProver_bot,sK0(iProver_bot)))
| big_f(sK1(iProver_bot,sK0(iProver_bot)),sK0(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_164]) ).
cnf(c_168,plain,
( ~ big_f(sK1(X0,sK0(X0)),sK0(X0))
| big_f(sK0(X0),sK1(X0,sK0(X0)))
| big_f(X0,sK1(X0,sK0(X0))) ),
inference(instantiation,[status(thm)],[c_160]) ).
cnf(c_170,plain,
( big_f(sK1(X0,sK0(X0)),sK0(X0))
| big_f(sK0(X0),sK1(X0,sK0(X0)))
| big_f(X0,sK1(X0,sK0(X0))) ),
inference(instantiation,[status(thm)],[c_155]) ).
cnf(c_171,plain,
( ~ big_f(sK0(X0),sK1(X0,sK0(X0)))
| big_f(X0,sK1(X0,sK0(X0))) ),
inference(instantiation,[status(thm)],[c_154]) ).
cnf(c_172,plain,
( ~ big_f(sK0(iProver_bot),sK1(iProver_bot,sK0(iProver_bot)))
| big_f(iProver_bot,sK1(iProver_bot,sK0(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_173,plain,
( big_f(sK1(iProver_bot,sK0(iProver_bot)),sK0(iProver_bot))
| big_f(sK0(iProver_bot),sK1(iProver_bot,sK0(iProver_bot)))
| big_f(iProver_bot,sK1(iProver_bot,sK0(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_170]) ).
cnf(c_174,plain,
( ~ big_f(sK1(iProver_bot,sK0(iProver_bot)),sK0(iProver_bot))
| big_f(sK0(iProver_bot),sK1(iProver_bot,sK0(iProver_bot)))
| big_f(iProver_bot,sK1(iProver_bot,sK0(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_168]) ).
cnf(c_182,plain,
( ~ big_f(X0,sK1(X0,sK0(X0)))
| big_f(sK0(X0),sK1(X0,sK0(X0))) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_183,plain,
( ~ big_f(iProver_bot,sK1(iProver_bot,sK0(iProver_bot)))
| big_f(sK0(iProver_bot),sK1(iProver_bot,sK0(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_182]) ).
cnf(c_185,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_183,c_174,c_173,c_172,c_166,c_165]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SYN349+1 : TPTP v8.1.2. Released v2.0.0.
% 0.02/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n005.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Thu May 2 20:48:11 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.74/1.10 % SZS status Started for theBenchmark.p
% 1.74/1.10 % SZS status Theorem for theBenchmark.p
% 1.74/1.10
% 1.74/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.74/1.10
% 1.74/1.10 ------ iProver source info
% 1.74/1.10
% 1.74/1.10 git: date: 2024-05-02 19:28:25 +0000
% 1.74/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.74/1.10 git: non_committed_changes: false
% 1.74/1.10
% 1.74/1.10 ------ Parsing...
% 1.74/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.74/1.10
% 1.74/1.10 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.74/1.10
% 1.74/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.74/1.10 ------ Proving...
% 1.74/1.10 ------ Problem Properties
% 1.74/1.10
% 1.74/1.10
% 1.74/1.10 clauses 10
% 1.74/1.10 conjectures 10
% 1.74/1.10 EPR 0
% 1.74/1.10 Horn 3
% 1.74/1.10 unary 0
% 1.74/1.10 binary 2
% 1.74/1.10 lits 36
% 1.74/1.10 lits eq 0
% 1.74/1.10 fd_pure 0
% 1.74/1.10 fd_pseudo 0
% 1.74/1.10 fd_cond 0
% 1.74/1.10 fd_pseudo_cond 0
% 1.74/1.10 AC symbols 0
% 1.74/1.10
% 1.74/1.10 ------ Schedule dynamic 5 is on
% 1.74/1.10
% 1.74/1.10 ------ no equalities: superposition off
% 1.74/1.10
% 1.74/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.74/1.10
% 1.74/1.10
% 1.74/1.10 ------
% 1.74/1.10 Current options:
% 1.74/1.10 ------
% 1.74/1.10
% 1.74/1.10
% 1.74/1.10
% 1.74/1.10
% 1.74/1.10 ------ Proving...
% 1.74/1.10
% 1.74/1.10
% 1.74/1.10 % SZS status Theorem for theBenchmark.p
% 1.74/1.10
% 1.74/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.74/1.10
% 1.74/1.10
%------------------------------------------------------------------------------