%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWX207+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:32:50 PM UTC 2026
% Result : Theorem 3.94s 1.42s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 37 unt; 0 def)
% Number of atoms : 55 ( 54 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 13 ~; 7 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 47 !; 4 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
pB != pE,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_016) ).
fof(f17,axiom,
! [X0,X1] : proj1C(c2(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_017) ).
fof(f19,axiom,
! [X0] : append(nil,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_019) ).
fof(f20,axiom,
! [X0,X1,X2] : append(cons(X1,X2),X0) = cons(X1,append(X2,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_020) ).
fof(f22,axiom,
! [X0] : linP(bP(X0)) = append(cons(b,nil),append(linP(X0),cons(b,nil))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_022) ).
fof(f24,axiom,
linP(pB) = cons(b,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_024) ).
fof(f25,axiom,
linP(pE) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_025) ).
fof(f26,axiom,
! [X0,X1] : linC(c2(X0,X1)) = append(linP(X0),linP(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_026) ).
fof(f27,conjecture,
? [X0,X1] :
~ ( linC(X0) = linC(X1)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_027) ).
fof(f28,negated_conjecture,
~ ? [X0,X1] :
~ ( linC(X0) = linC(X1)
=> X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( linC(X0) != linC(X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f28]) ).
fof(f45,plain,
pB != pE,
inference(cnf_transformation,[],[f16]) ).
fof(f46,plain,
! [X0,X1] : proj1C(c2(X0,X1)) = X0,
inference(cnf_transformation,[],[f17]) ).
fof(f48,plain,
! [X0] : append(nil,X0) = X0,
inference(cnf_transformation,[],[f19]) ).
fof(f49,plain,
! [X2,X0,X1] : append(cons(X1,X2),X0) = cons(X1,append(X2,X0)),
inference(cnf_transformation,[],[f20]) ).
fof(f51,plain,
! [X0] : linP(bP(X0)) = append(cons(b,nil),append(linP(X0),cons(b,nil))),
inference(cnf_transformation,[],[f22]) ).
fof(f53,plain,
cons(b,nil) = linP(pB),
inference(cnf_transformation,[],[f24]) ).
fof(f54,plain,
nil = linP(pE),
inference(cnf_transformation,[],[f25]) ).
fof(f55,plain,
! [X0,X1] : linC(c2(X0,X1)) = append(linP(X0),linP(X1)),
inference(cnf_transformation,[],[f26]) ).
fof(f56,plain,
! [X0,X1] :
( linC(X0) != linC(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_64,plain,
pB != pE,
inference(cnf_transformation,[],[f45]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] : proj1C(c2(X0,X1)) = X0,
inference(cnf_transformation,[],[f46]) ).
tcf(c_67,plain,
! [X0: $i] : append(nil,X0) = X0,
inference(cnf_transformation,[],[f48]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i] : cons(X0,append(X1,X2)) = append(cons(X0,X1),X2),
inference(cnf_transformation,[],[f49]) ).
tcf(c_70,plain,
! [X0: $i] : append(cons(b,nil),append(linP(X0),cons(b,nil))) = linP(bP(X0)),
inference(cnf_transformation,[],[f51]) ).
tcf(c_72,plain,
cons(b,nil) = linP(pB),
inference(cnf_transformation,[],[f53]) ).
tcf(c_73,plain,
linP(pE) = nil,
inference(cnf_transformation,[],[f54]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : append(linP(X0),linP(X1)) = linC(c2(X0,X1)),
inference(cnf_transformation,[],[f55]) ).
tcf(c_75,negated_conjecture,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( linC(X0) != linC(X1) ) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_154,plain,
! [X0: $i] : append(linP(pB),append(linP(X0),linP(pB))) = linP(bP(X0)),
inference(light_normalisation,[status(thm)],[c_70,c_72]) ).
tcf(c_155,plain,
! [X0: $i] : append(linP(pB),linC(c2(X0,pB))) = linP(bP(X0)),
inference(demodulation,[status(thm)],[c_154,c_74]) ).
tcf(c_173,negated_conjecture,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( linC(X0) != linC(X1) ) ),
inference(demodulation,[status(thm)],[c_75]) ).
tcf(c_402,plain,
! [X0: $i] : append(nil,linP(X0)) = linC(c2(pE,X0)),
inference(superposition,[status(thm)],[c_73,c_74]) ).
tcf(c_407,plain,
! [X0: $i] : cons(b,append(nil,X0)) = append(linP(pB),X0),
inference(superposition,[status(thm)],[c_72,c_68]) ).
tcf(c_408,plain,
! [X0: $i] : append(linP(pB),X0) = cons(b,X0),
inference(light_normalisation,[status(thm)],[c_407,c_67]) ).
tcf(c_410,plain,
! [X0: $i] : cons(b,linC(c2(X0,pB))) = linP(bP(X0)),
inference(demodulation,[status(thm)],[c_155,c_408]) ).
tcf(c_416,plain,
! [X0: $i] : cons(b,linP(X0)) = linC(c2(pB,X0)),
inference(superposition,[status(thm)],[c_74,c_408]) ).
tcf(c_422,plain,
! [X0: $i] : linC(c2(pE,X0)) = linP(X0),
inference(demodulation,[status(thm)],[c_402,c_67]) ).
tcf(c_498,plain,
cons(b,linP(pB)) = linP(bP(pE)),
inference(superposition,[status(thm)],[c_422,c_410]) ).
tcf(c_512,plain,
! [X0: $i,X1: $i] :
( ( c2(pB,X0) = X1 )
| ( cons(b,linP(X0)) != linC(X1) ) ),
inference(superposition,[status(thm)],[c_416,c_173]) ).
tcf(c_554,plain,
! [X0: $i] :
( ( c2(pB,pB) = X0 )
| ( linP(bP(pE)) != linC(X0) ) ),
inference(superposition,[status(thm)],[c_498,c_512]) ).
tcf(c_585,plain,
! [X0: $i] :
( ( c2(pE,X0) = c2(pB,pB) )
| ( linP(bP(pE)) != linP(X0) ) ),
inference(superposition,[status(thm)],[c_422,c_554]) ).
tcf(c_898,plain,
c2(pE,bP(pE)) = c2(pB,pB),
inference(equality_resolution,[status(thm)],[c_585]) ).
tcf(c_989,plain,
proj1C(c2(pB,pB)) = pE,
inference(superposition,[status(thm)],[c_898,c_65]) ).
tcf(c_996,plain,
pB = pE,
inference(demodulation,[status(thm)],[c_989,c_65]) ).
tcf(c_997,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_996,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX207+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.44 % Computer : n016.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Thu Sep 24 23:43:28 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.27/0.52
% 0.27/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.27/0.52
% 0.27/0.52 % Detected problem language: tptp
% 0.27/0.54 % Proving...
% 3.94/1.42 % SZS status Started for theBenchmark.p
% 3.94/1.42 % SZS status Theorem for theBenchmark.p
% 3.94/1.42
% 3.94/1.42 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.94/1.42
% 3.94/1.42 % ------ iProver source info
% 3.94/1.42
% 3.94/1.42 % git: date: 2026-07-19 20:42:38 +0200
% 3.94/1.42 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.94/1.42 % git: non_committed_changes: false
% 3.94/1.42
% 3.94/1.42 % ------ Parsing...
% 3.94/1.42 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.94/1.42
% 3.94/1.42 % ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.94/1.42
% 3.94/1.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.94/1.42
% 3.94/1.42 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.94/1.42 % ------ Proving...
% 3.94/1.42 % ------ Problem Properties
% 3.94/1.42
% 3.94/1.42 %
% 3.94/1.42 % clauses 27
% 3.94/1.42 % conjectures 1
% 3.94/1.42 % EPR 4
% 3.94/1.42 % Horn 27
% 3.94/1.42 % unary 26
% 3.94/1.42 % binary 1
% 3.94/1.42 % lits 28
% 3.94/1.42 % lits eq 28
% 3.94/1.42 % fd_pure 0
% 3.94/1.42 % fd_pseudo 0
% 3.94/1.42 % fd_cond 0
% 3.94/1.42 % fd_pseudo_cond 1
% 3.94/1.42 % AC symbols 0
% 3.94/1.42
% 3.94/1.42 % ------ Schedule dynamic 5 is on
% 3.94/1.42
% 3.94/1.42 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.94/1.42
% 3.94/1.42
% 3.94/1.42 % ------
% 3.94/1.42 % Current options:
% 3.94/1.42 % ------
% 3.94/1.42
% 3.94/1.42
% 3.94/1.42 %
% 3.94/1.42
% 3.94/1.42 % ------ Proving...
% 3.94/1.42 %
% 3.94/1.42
% 3.94/1.42 % SZS status Theorem for theBenchmark.p
% 3.94/1.42
% 3.94/1.42 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.94/1.42
% 3.94/1.42
%------------------------------------------------------------------------------