%------------------------------------------------------------------------------
% 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 : n018.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 : Unsatisfiable 2.54s 1.20s
% Output : CNFRefutation 2.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 41 unt; 0 def)
% Number of atoms : 47 ( 46 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 13 ~; 3 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 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 : 17 ( 17 usr; 6 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 57 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : impl(btrue,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom) ).
fof(f4,axiom,
! [X0] : append(nil,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).
fof(f5,axiom,
! [X2,X0,X1] : append(cons(X0,X1),X2) = cons(X0,append(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
fof(f8,axiom,
linP(pA) = cons(a,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_006) ).
fof(f9,plain,
cons(a,nil) = linP(pA),
inference(reorient_equations,[],[f8]) ).
fof(f12,axiom,
linP(pE) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_008) ).
fof(f13,plain,
nil = linP(pE),
inference(reorient_equations,[],[f12]) ).
fof(f14,axiom,
! [X0,X1] : linC(c2(X0,X1)) = append(linP(X0),linP(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_009) ).
fof(f15,axiom,
! [X0,X1] : unambig(X0,X1) = impl(eq(linC(X0),linC(X1)),eq4(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_010) ).
fof(f22,axiom,
eq3(pA,pE) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_014) ).
fof(f23,plain,
bfalse = eq3(pA,pE),
inference(reorient_equations,[],[f22]) ).
fof(f67,axiom,
! [X2,X3,X0,X1] :
( eq4(c2(X0,X2),c2(X1,X3)) = bfalse
| eq3(X0,X1) != bfalse ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_037) ).
fof(f68,plain,
! [X2,X3,X0,X1] :
( bfalse = eq4(c2(X0,X2),c2(X1,X3))
| bfalse != eq3(X0,X1) ),
inference(reorient_equations,[],[f67]) ).
fof(f71,axiom,
! [X0] : eq(X0,X0) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_039) ).
fof(f72,plain,
! [X0] : btrue = eq(X0,X0),
inference(reorient_equations,[],[f71]) ).
fof(f79,axiom,
! [X0] : eq5(X0,X0) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_043) ).
fof(f80,plain,
! [X0] : btrue = eq5(X0,X0),
inference(reorient_equations,[],[f79]) ).
fof(f89,negated_conjecture,
! [X0,X1] : eq5(unambig(X0,X1),bfalse) != btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
fof(f90,plain,
! [X0,X1] : btrue != eq5(unambig(X0,X1),bfalse),
inference(reorient_equations,[],[f89]) ).
fof(f91,plain,
! [X0,X1] : btrue != eq5(impl(eq(linC(X0),linC(X1)),eq4(X0,X1)),bfalse),
inference(definition_unfolding,[],[f90,f15]) ).
tcf(c_98,plain,
! [X0: $i] : impl(btrue,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_100,plain,
! [X0: $i] : append(nil,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i,X2: $i] : append(cons(X0,X1),X2) = cons(X0,append(X1,X2)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_104,plain,
cons(a,nil) = linP(pA),
inference(cnf_transformation,[],[f9]) ).
tcf(c_106,plain,
linP(pE) = nil,
inference(cnf_transformation,[],[f13]) ).
tcf(c_107,plain,
! [X0: $i,X1: $i] : append(linP(X0),linP(X1)) = linC(c2(X0,X1)),
inference(cnf_transformation,[],[f14]) ).
tcf(c_111,plain,
eq3(pA,pE) = bfalse,
inference(cnf_transformation,[],[f23]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( eq4(c2(X0,X2),c2(X1,X3)) = bfalse )
| ( eq3(X0,X1) != bfalse ) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_136,plain,
! [X0: $i] : eq(X0,X0) = btrue,
inference(cnf_transformation,[],[f72]) ).
tcf(c_140,plain,
! [X0: $i] : eq5(X0,X0) = btrue,
inference(cnf_transformation,[],[f80]) ).
tcf(c_145,negated_conjecture,
! [X0: $i,X1: $i] : eq5(impl(eq(linC(X0),linC(X1)),eq4(X0,X1)),bfalse) != btrue,
inference(cnf_transformation,[],[f91]) ).
tcf(c_318,negated_conjecture,
! [X0: $i,X1: $i] : eq5(impl(eq(linC(X0),linC(X1)),eq4(X0,X1)),bfalse) != btrue,
inference(demodulation,[status(thm)],[c_145]) ).
tcf(c_530,plain,
! [X0: $i] : append(nil,linP(X0)) = linC(c2(pE,X0)),
inference(superposition,[status(thm)],[c_106,c_107]) ).
tcf(c_531,plain,
! [X0: $i] : append(linP(X0),nil) = linC(c2(X0,pE)),
inference(superposition,[status(thm)],[c_106,c_107]) ).
tcf(c_534,plain,
! [X0: $i] : linC(c2(pE,X0)) = linP(X0),
inference(demodulation,[status(thm)],[c_530,c_100]) ).
tcf(c_535,plain,
! [X0: $i,X1: $i] : eq5(impl(eq(linC(X0),linP(X1)),eq4(X0,c2(pE,X1))),bfalse) != btrue,
inference(superposition,[status(thm)],[c_534,c_318]) ).
tcf(c_549,plain,
! [X0: $i,X1: $i] : eq5(impl(eq(append(linP(X0),nil),linP(X1)),eq4(c2(X0,pE),c2(pE,X1))),bfalse) != btrue,
inference(superposition,[status(thm)],[c_531,c_535]) ).
tcf(c_595,plain,
! [X0: $i] : cons(a,append(nil,X0)) = append(linP(pA),X0),
inference(superposition,[status(thm)],[c_104,c_101]) ).
tcf(c_598,plain,
! [X0: $i] : append(linP(pA),X0) = cons(a,X0),
inference(light_normalisation,[status(thm)],[c_595,c_100]) ).
tcf(c_608,plain,
! [X0: $i,X1: $i] : eq4(c2(pA,X0),c2(pE,X1)) = bfalse,
inference(superposition,[status(thm)],[c_111,c_134]) ).
tcf(c_913,plain,
! [X0: $i] : eq5(impl(eq(append(linP(pA),nil),linP(X0)),bfalse),bfalse) != btrue,
inference(superposition,[status(thm)],[c_608,c_549]) ).
tcf(c_940,plain,
! [X0: $i] : eq5(impl(eq(linP(pA),linP(X0)),bfalse),bfalse) != btrue,
inference(demodulation,[status(thm)],[c_913,c_104,c_598]) ).
tcf(c_941,plain,
eq5(impl(btrue,bfalse),bfalse) != btrue,
inference(superposition,[status(thm)],[c_136,c_940]) ).
tcf(c_943,plain,
$false,
inference(ground_joinability,[status(thm)],[c_941,c_98,c_140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX207-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 23:40:49 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 2.54/1.20 % SZS status Started for theBenchmark.p
% 2.54/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.54/1.20
% 2.54/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.54/1.20
% 2.54/1.20 % ------ iProver source info
% 2.54/1.20
% 2.54/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 2.54/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.54/1.20 % git: non_committed_changes: false
% 2.54/1.20
% 2.54/1.20 % ------ Parsing...% successful
% 2.54/1.20
% 2.54/1.20
% 2.54/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.54/1.20
% 2.54/1.20 % ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.54/1.20
% 2.54/1.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.54/1.20
% 2.54/1.20 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.54/1.20 % ------ Proving...
% 2.54/1.20 % ------ Problem Properties
% 2.54/1.20
% 2.54/1.20 %
% 2.54/1.20 % clauses 48
% 2.54/1.20 % conjectures 1
% 2.54/1.20 % EPR 0
% 2.54/1.20 % Horn 48
% 2.54/1.20 % unary 44
% 2.54/1.20 % binary 4
% 2.54/1.20 % lits 52
% 2.54/1.20 % lits eq 52
% 2.54/1.20 % fd_pure 0
% 2.54/1.20 % fd_pseudo 0
% 2.54/1.20 % fd_cond 0
% 2.54/1.20 % fd_pseudo_cond 0
% 2.54/1.20 % AC symbols 0
% 2.54/1.20
% 2.54/1.20 % ------ Schedule dynamic 5 is on
% 2.54/1.20
% 2.54/1.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.54/1.20
% 2.54/1.20
% 2.54/1.20 % ------
% 2.54/1.20 % Current options:
% 2.54/1.20 % ------
% 2.54/1.20
% 2.54/1.20
% 2.54/1.20 %
% 2.54/1.20
% 2.54/1.20 % ------ Proving...
% 2.54/1.20 %
% 2.54/1.20
% 2.54/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.54/1.20
% 2.54/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.54/1.20
% 2.54/1.20
%------------------------------------------------------------------------------