TSTP Solution File: SWC249-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC249-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:11:44 EDT 2024
% Result : Unsatisfiable 139.39s 19.23s
% Output : CNFRefutation 139.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 18
% Syntax : Number of clauses : 70 ( 22 unt; 8 nHn; 56 RR)
% Number of literals : 172 ( 40 equ; 106 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 85 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(c_52,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
cnf(c_57,negated_conjecture,
sk1 != nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(c_60,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sk1
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X0,sk5(X2,X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(c_71,plain,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_76,plain,
ssList(skaf82(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(c_134,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_135,plain,
( ~ ssList(X0)
| ssItem(X1)
| duplicatefreeP(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(c_137,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(c_141,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause78) ).
cnf(c_148,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(c_149,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_159,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(c_167,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(c_172,plain,
( ~ ssList(X0)
| cons(skaf83(X0),skaf82(X0)) = X0
| X0 = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(c_183,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(c_212,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X2,X1),X0) = app(X2,app(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(c_242,plain,
( app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ duplicatefreeP(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(c_265,plain,
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(unflattening,[status(thm)],[c_242]) ).
cnf(c_6574,plain,
( ssItem(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_135]) ).
cnf(c_6575,plain,
( duplicatefreeP(X0)
| ~ ssList(X0)
| ~ sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_135]) ).
cnf(c_6576,plain,
( sP0_iProver_def
| sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_135]) ).
cnf(c_6580,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sk1
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X0,sk5(X2,X0,X1)) ),
inference(demodulation,[status(thm)],[c_60]) ).
cnf(c_6582,negated_conjecture,
sk1 != nil,
inference(demodulation,[status(thm)],[c_57]) ).
cnf(c_6585,negated_conjecture,
ssList(sk4),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_6586,negated_conjecture,
ssList(sk1),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_11454,plain,
( ~ ssList(sk1)
| sk1 = nil
| ssItem(hd(sk1)) ),
inference(instantiation,[status(thm)],[c_141]) ).
cnf(c_15969,plain,
( ~ ssList(app(app(X0,cons(hd(sk1),X1)),cons(hd(sk1),X2)))
| ~ duplicatefreeP(app(app(X0,cons(hd(sk1),X1)),cons(hd(sk1),X2)))
| ~ ssItem(hd(sk1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(instantiation,[status(thm)],[c_265]) ).
cnf(c_15986,plain,
( ~ ssList(app(app(nil,cons(hd(sk1),nil)),cons(hd(sk1),nil)))
| ~ duplicatefreeP(app(app(nil,cons(hd(sk1),nil)),cons(hd(sk1),nil)))
| ~ ssItem(hd(sk1))
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_15969]) ).
cnf(c_50398,plain,
( ~ ssItem(hd(sk1))
| ~ ssList(nil)
| ssList(cons(hd(sk1),nil)) ),
inference(instantiation,[status(thm)],[c_149]) ).
cnf(c_58742,plain,
( ~ ssList(cons(hd(sk1),nil))
| ~ ssList(X0)
| ssList(app(X0,cons(hd(sk1),nil))) ),
inference(instantiation,[status(thm)],[c_148]) ).
cnf(c_58743,plain,
( ~ ssList(cons(hd(sk1),nil))
| ~ ssList(nil)
| ssList(app(nil,cons(hd(sk1),nil))) ),
inference(instantiation,[status(thm)],[c_58742]) ).
cnf(c_99279,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ~ sP1_iProver_def
| duplicatefreeP(app(X1,X0)) ),
inference(superposition,[status(thm)],[c_148,c_6575]) ).
cnf(c_102316,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X1,X0),sk4) = app(X1,app(X0,sk4)) ),
inference(superposition,[status(thm)],[c_6585,c_212]) ).
cnf(c_179688,plain,
( ~ ssList(app(X0,cons(hd(sk1),X1)))
| ~ ssList(cons(hd(sk1),nil))
| ssList(app(app(X0,cons(hd(sk1),X1)),cons(hd(sk1),nil))) ),
inference(instantiation,[status(thm)],[c_58742]) ).
cnf(c_179693,plain,
( ~ ssList(app(nil,cons(hd(sk1),nil)))
| ~ ssList(cons(hd(sk1),nil))
| ssList(app(app(nil,cons(hd(sk1),nil)),cons(hd(sk1),nil))) ),
inference(instantiation,[status(thm)],[c_179688]) ).
cnf(c_183659,plain,
( ~ ssList(X0)
| app(app(X0,sk1),sk4) = app(X0,app(sk1,sk4)) ),
inference(superposition,[status(thm)],[c_6586,c_102316]) ).
cnf(c_185060,plain,
app(app(sk1,sk1),sk4) = app(sk1,app(sk1,sk4)),
inference(superposition,[status(thm)],[c_6586,c_183659]) ).
cnf(c_186635,plain,
( ~ ssList(app(sk1,sk1))
| ~ ssList(sk4)
| ~ sP1_iProver_def
| duplicatefreeP(app(sk1,app(sk1,sk4))) ),
inference(superposition,[status(thm)],[c_185060,c_99279]) ).
cnf(c_186661,plain,
( ~ ssList(app(sk1,sk1))
| ~ sP1_iProver_def
| duplicatefreeP(app(sk1,app(sk1,sk4))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_186635,c_6585]) ).
cnf(c_192729,plain,
( ~ ssList(app(app(X0,cons(hd(sk1),X1)),cons(hd(sk1),X2)))
| ~ sP1_iProver_def
| duplicatefreeP(app(app(X0,cons(hd(sk1),X1)),cons(hd(sk1),X2))) ),
inference(instantiation,[status(thm)],[c_6575]) ).
cnf(c_192730,plain,
( ~ ssList(app(app(nil,cons(hd(sk1),nil)),cons(hd(sk1),nil)))
| ~ sP1_iProver_def
| duplicatefreeP(app(app(nil,cons(hd(sk1),nil)),cons(hd(sk1),nil))) ),
inference(instantiation,[status(thm)],[c_192729]) ).
cnf(c_192749,plain,
~ sP1_iProver_def,
inference(global_subsumption_just,[status(thm)],[c_186661,c_49,c_71,c_57,c_11454,c_15986,c_50398,c_58743,c_179693,c_192730]) ).
cnf(c_192751,plain,
sP0_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_6576,c_192749]) ).
cnf(c_192756,plain,
ssItem(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_6574,c_192751]) ).
cnf(c_192849,plain,
( ~ ssList(X0)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_183,c_192756]) ).
cnf(c_192860,plain,
( ~ ssList(X0)
| tl(cons(X1,X0)) = X0 ),
inference(backward_subsumption_resolution,[status(thm)],[c_159,c_192756]) ).
cnf(c_192861,plain,
( ~ ssList(X0)
| ssList(cons(X1,X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_149,c_192756]) ).
cnf(c_192876,plain,
( app(app(X0,cons(X1,nil)),X2) != sk1
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(X0,sk5(X2,X0,X1)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_6580,c_192756]) ).
cnf(c_195397,plain,
( ~ ssList(X2)
| ~ ssList(X0)
| app(app(X0,cons(X1,nil)),X2) != sk1
| memberP(X0,sk5(X2,X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_6580,c_192876]) ).
cnf(c_195398,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sk1
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(X0,sk5(X2,X0,X1)) ),
inference(renaming,[status(thm)],[c_195397]) ).
cnf(c_195550,plain,
~ memberP(nil,X0),
inference(global_subsumption_just,[status(thm)],[c_134,c_49,c_71,c_57,c_134,c_6574,c_6576,c_11454,c_15986,c_50398,c_58743,c_179693,c_192730]) ).
cnf(c_195736,plain,
( ~ ssList(X0)
| ssList(cons(X1,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_149,c_192861]) ).
cnf(c_195742,plain,
( ~ ssList(X0)
| app(nil,cons(X1,X0)) = cons(X1,X0) ),
inference(superposition,[status(thm)],[c_195736,c_137]) ).
cnf(c_196297,plain,
( ~ ssList(X0)
| tl(cons(X1,X0)) = X0 ),
inference(global_subsumption_just,[status(thm)],[c_159,c_192860]) ).
cnf(c_196306,plain,
tl(cons(X0,skaf82(X1))) = skaf82(X1),
inference(superposition,[status(thm)],[c_76,c_196297]) ).
cnf(c_196592,plain,
( cons(hd(sk1),tl(sk1)) = sk1
| sk1 = nil ),
inference(superposition,[status(thm)],[c_6586,c_167]) ).
cnf(c_196627,plain,
cons(hd(sk1),tl(sk1)) = sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_196592,c_6582]) ).
cnf(c_196872,plain,
( cons(skaf83(sk1),skaf82(sk1)) = sk1
| sk1 = nil ),
inference(superposition,[status(thm)],[c_6586,c_172]) ).
cnf(c_196906,plain,
cons(skaf83(sk1),skaf82(sk1)) = sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_196872,c_6582]) ).
cnf(c_196998,plain,
( ~ ssList(X0)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_183,c_192849]) ).
cnf(c_209176,plain,
skaf82(sk1) = tl(sk1),
inference(superposition,[status(thm)],[c_196906,c_196306]) ).
cnf(c_211644,plain,
ssList(tl(sk1)),
inference(superposition,[status(thm)],[c_209176,c_76]) ).
cnf(c_211722,plain,
app(cons(X0,nil),tl(sk1)) = cons(X0,tl(sk1)),
inference(superposition,[status(thm)],[c_211644,c_196998]) ).
cnf(c_359127,plain,
app(nil,cons(X0,nil)) = cons(X0,nil),
inference(superposition,[status(thm)],[c_71,c_195742]) ).
cnf(c_359725,plain,
( app(cons(X0,nil),X1) != sk1
| ~ ssList(X1)
| ~ ssList(nil)
| memberP(nil,sk5(X1,nil,X0)) ),
inference(superposition,[status(thm)],[c_359127,c_195398]) ).
cnf(c_359780,plain,
( app(cons(X0,nil),X1) != sk1
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_359725,c_195550,c_71]) ).
cnf(c_360119,plain,
( cons(X0,tl(sk1)) != sk1
| ~ ssList(tl(sk1)) ),
inference(superposition,[status(thm)],[c_211722,c_359780]) ).
cnf(c_360127,plain,
cons(X0,tl(sk1)) != sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_360119,c_211644]) ).
cnf(c_360181,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_196627,c_360127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC249-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:26:49 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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
% 139.39/19.23 % SZS status Started for theBenchmark.p
% 139.39/19.23 % SZS status Unsatisfiable for theBenchmark.p
% 139.39/19.23
% 139.39/19.23 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 139.39/19.23
% 139.39/19.23 ------ iProver source info
% 139.39/19.23
% 139.39/19.23 git: date: 2024-05-02 19:28:25 +0000
% 139.39/19.23 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 139.39/19.23 git: non_committed_changes: false
% 139.39/19.23
% 139.39/19.23 ------ Parsing...successful
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23 ------ Preprocessing... sup_sim: 7 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 139.39/19.23
% 139.39/19.23 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 139.39/19.23
% 139.39/19.23 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 139.39/19.23 ------ Proving...
% 139.39/19.23 ------ Problem Properties
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23 clauses 190
% 139.39/19.23 conjectures 10
% 139.39/19.23 EPR 60
% 139.39/19.23 Horn 162
% 139.39/19.23 unary 65
% 139.39/19.23 binary 21
% 139.39/19.23 lits 578
% 139.39/19.23 lits eq 78
% 139.39/19.23 fd_pure 0
% 139.39/19.23 fd_pseudo 0
% 139.39/19.23 fd_cond 16
% 139.39/19.23 fd_pseudo_cond 14
% 139.39/19.23 AC symbols 0
% 139.39/19.23
% 139.39/19.23 ------ Schedule dynamic 5 is on
% 139.39/19.23
% 139.39/19.23 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23 ------
% 139.39/19.23 Current options:
% 139.39/19.23 ------
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23 ------ Proving...
% 139.39/19.23 Proof_search_loop: time out after: 7131 full_loop iterations
% 139.39/19.23
% 139.39/19.23 ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23 ------
% 139.39/19.23 Current options:
% 139.39/19.23 ------
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23 ------ Proving...
% 139.39/19.23
% 139.39/19.23
% 139.39/19.23 % SZS status Unsatisfiable for theBenchmark.p
% 139.39/19.23
% 139.39/19.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 139.39/19.23
% 139.39/19.24
%------------------------------------------------------------------------------