TSTP Solution File: SWC225-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC225-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 : Thu Aug 31 20:41:49 EDT 2023
% Result : Unsatisfiable 221.39s 29.93s
% Output : CNFRefutation 221.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 20
% Syntax : Number of clauses : 70 ( 21 unt; 11 nHn; 52 RR)
% Number of literals : 169 ( 48 equ; 103 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 : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 93 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(c_54,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(c_55,negated_conjecture,
sk1 != nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_57,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/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(c_61,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(c_65,negated_conjecture,
( app(cons(X0,nil),X1) != sk3
| app(X2,cons(X0,nil)) != sk6
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(c_75,plain,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_79,plain,
ssItem(skaf83(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(c_80,plain,
ssList(skaf82(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(c_138,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_139,plain,
( ~ ssList(X0)
| ssItem(X1)
| duplicatefreeP(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(c_141,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(c_145,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause78) ).
cnf(c_152,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_163,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(c_171,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(c_176,plain,
( ~ ssList(X0)
| cons(skaf83(X0),skaf82(X0)) = X0
| X0 = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(c_187,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(c_246,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/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(c_269,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_246]) ).
cnf(c_2513,plain,
( app(cons(X0,nil),X1) != sk1
| app(X2,cons(X0,nil)) != sk6
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0) ),
inference(light_normalisation,[status(thm)],[c_65,c_54]) ).
cnf(c_6642,plain,
( ssItem(X0)
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_139]) ).
cnf(c_6643,plain,
( duplicatefreeP(X0)
| ~ ssList(X0)
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_139]) ).
cnf(c_6644,plain,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_139]) ).
cnf(c_9597,plain,
( ~ sP1_iProver_split
| duplicatefreeP(skaf82(X0)) ),
inference(superposition,[status(thm)],[c_80,c_6643]) ).
cnf(c_10178,plain,
( ~ ssItem(X0)
| tl(cons(X0,skaf82(X1))) = skaf82(X1) ),
inference(superposition,[status(thm)],[c_80,c_163]) ).
cnf(c_11371,plain,
( ~ ssList(sk1)
| sk1 = nil
| ssItem(hd(sk1)) ),
inference(instantiation,[status(thm)],[c_145]) ).
cnf(c_11558,plain,
( cons(skaf83(sk6),skaf82(sk6)) = sk6
| nil = sk6 ),
inference(superposition,[status(thm)],[c_61,c_176]) ).
cnf(c_15387,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_269]) ).
cnf(c_15404,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_15387]) ).
cnf(c_48230,plain,
( ~ ssItem(hd(sk1))
| ~ ssList(nil)
| ssList(cons(hd(sk1),nil)) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_50208,plain,
( ~ ssList(cons(hd(sk1),nil))
| ~ ssList(X0)
| ssList(app(X0,cons(hd(sk1),nil))) ),
inference(instantiation,[status(thm)],[c_152]) ).
cnf(c_50209,plain,
( ~ ssList(cons(hd(sk1),nil))
| ~ ssList(nil)
| ssList(app(nil,cons(hd(sk1),nil))) ),
inference(instantiation,[status(thm)],[c_50208]) ).
cnf(c_62455,plain,
( ~ ssList(app(X0,cons(hd(sk1),X1)))
| ~ ssList(cons(hd(sk1),X2))
| ssList(app(app(X0,cons(hd(sk1),X1)),cons(hd(sk1),X2))) ),
inference(instantiation,[status(thm)],[c_152]) ).
cnf(c_62456,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_62455]) ).
cnf(c_188497,plain,
tl(cons(skaf83(X0),skaf82(X1))) = skaf82(X1),
inference(superposition,[status(thm)],[c_79,c_10178]) ).
cnf(c_188905,plain,
( skaf82(sk6) = tl(sk6)
| nil = sk6 ),
inference(superposition,[status(thm)],[c_11558,c_188497]) ).
cnf(c_194521,plain,
( ~ sP1_iProver_split
| nil = sk6
| duplicatefreeP(tl(sk6)) ),
inference(superposition,[status(thm)],[c_188905,c_9597]) ).
cnf(c_197520,plain,
( ~ ssList(app(app(X0,cons(hd(sk1),X1)),cons(hd(sk1),X2)))
| ~ sP1_iProver_split
| duplicatefreeP(app(app(X0,cons(hd(sk1),X1)),cons(hd(sk1),X2))) ),
inference(instantiation,[status(thm)],[c_6643]) ).
cnf(c_197521,plain,
( ~ ssList(app(app(nil,cons(hd(sk1),nil)),cons(hd(sk1),nil)))
| ~ sP1_iProver_split
| duplicatefreeP(app(app(nil,cons(hd(sk1),nil)),cons(hd(sk1),nil))) ),
inference(instantiation,[status(thm)],[c_197520]) ).
cnf(c_197843,plain,
~ sP1_iProver_split,
inference(global_subsumption_just,[status(thm)],[c_194521,c_49,c_75,c_55,c_11371,c_15404,c_48230,c_50209,c_62456,c_197521]) ).
cnf(c_197845,plain,
sP0_iProver_split,
inference(backward_subsumption_resolution,[status(thm)],[c_6644,c_197843]) ).
cnf(c_197877,plain,
ssItem(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_6642,c_197845]) ).
cnf(c_198009,plain,
( ~ ssList(X0)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_187,c_197877]) ).
cnf(c_198020,plain,
( ~ ssList(X0)
| tl(cons(X1,X0)) = X0 ),
inference(backward_subsumption_resolution,[status(thm)],[c_163,c_197877]) ).
cnf(c_198021,plain,
( ~ ssList(X0)
| ssList(cons(X1,X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_153,c_197877]) ).
cnf(c_198036,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_57,c_197877]) ).
cnf(c_283674,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_57,c_198036]) ).
cnf(c_283675,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_283674]) ).
cnf(c_283844,plain,
~ memberP(nil,X0),
inference(global_subsumption_just,[status(thm)],[c_138,c_49,c_75,c_55,c_138,c_6642,c_6644,c_11371,c_15404,c_48230,c_50209,c_62456,c_197521]) ).
cnf(c_283965,plain,
( ~ ssList(X0)
| ssList(cons(X1,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_153,c_198021]) ).
cnf(c_283971,plain,
( ~ ssList(X0)
| app(nil,cons(X1,X0)) = cons(X1,X0) ),
inference(superposition,[status(thm)],[c_283965,c_141]) ).
cnf(c_543713,plain,
app(nil,cons(X0,nil)) = cons(X0,nil),
inference(superposition,[status(thm)],[c_75,c_283971]) ).
cnf(c_544716,plain,
( app(cons(X0,nil),X1) != sk1
| ~ ssList(X1)
| ~ ssList(nil)
| memberP(nil,sk5(X1,nil,X0)) ),
inference(superposition,[status(thm)],[c_543713,c_283675]) ).
cnf(c_544760,plain,
( app(cons(X0,nil),X1) != sk1
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_544716,c_283844,c_75]) ).
cnf(c_631575,plain,
( ~ ssList(X0)
| tl(cons(X1,X0)) = X0 ),
inference(global_subsumption_just,[status(thm)],[c_163,c_198020]) ).
cnf(c_631586,plain,
tl(cons(X0,skaf82(X1))) = skaf82(X1),
inference(superposition,[status(thm)],[c_80,c_631575]) ).
cnf(c_631861,plain,
( cons(hd(sk1),tl(sk1)) = sk1
| sk1 = nil ),
inference(superposition,[status(thm)],[c_49,c_171]) ).
cnf(c_631902,plain,
cons(hd(sk1),tl(sk1)) = sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_631861,c_55]) ).
cnf(c_632106,plain,
( cons(skaf83(sk1),skaf82(sk1)) = sk1
| sk1 = nil ),
inference(superposition,[status(thm)],[c_49,c_176]) ).
cnf(c_632147,plain,
cons(skaf83(sk1),skaf82(sk1)) = sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_632106,c_55]) ).
cnf(c_632354,plain,
( ~ ssList(X0)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_187,c_198009]) ).
cnf(c_632365,plain,
app(cons(X0,nil),skaf82(X1)) = cons(X0,skaf82(X1)),
inference(superposition,[status(thm)],[c_80,c_632354]) ).
cnf(c_640122,plain,
( app(cons(X0,nil),X1) != sk1
| ~ ssList(X1) ),
inference(global_subsumption_just,[status(thm)],[c_2513,c_544760]) ).
cnf(c_671348,plain,
skaf82(sk1) = tl(sk1),
inference(superposition,[status(thm)],[c_632147,c_631586]) ).
cnf(c_672418,plain,
( cons(X0,skaf82(X1)) != sk1
| ~ ssList(skaf82(X1)) ),
inference(superposition,[status(thm)],[c_632365,c_640122]) ).
cnf(c_672436,plain,
cons(X0,skaf82(X1)) != sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_672418,c_80]) ).
cnf(c_722316,plain,
cons(X0,tl(sk1)) != sk1,
inference(superposition,[status(thm)],[c_671348,c_672436]) ).
cnf(c_722376,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_631902,c_722316]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC225-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.15/0.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Aug 28 18:58:09 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 221.39/29.93 % SZS status Started for theBenchmark.p
% 221.39/29.93 % SZS status Unsatisfiable for theBenchmark.p
% 221.39/29.93
% 221.39/29.93 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 221.39/29.93
% 221.39/29.93 ------ iProver source info
% 221.39/29.93
% 221.39/29.93 git: date: 2023-05-31 18:12:56 +0000
% 221.39/29.93 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 221.39/29.93 git: non_committed_changes: false
% 221.39/29.93 git: last_make_outside_of_git: false
% 221.39/29.93
% 221.39/29.93 ------ Parsing...successful
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93 ------ Preprocessing... sup_sim: 9 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 221.39/29.93
% 221.39/29.93 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 221.39/29.93
% 221.39/29.93 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 221.39/29.93 ------ Proving...
% 221.39/29.93 ------ Problem Properties
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93 clauses 193
% 221.39/29.93 conjectures 12
% 221.39/29.93 EPR 60
% 221.39/29.93 Horn 165
% 221.39/29.93 unary 67
% 221.39/29.93 binary 21
% 221.39/29.93 lits 585
% 221.39/29.93 lits eq 82
% 221.39/29.93 fd_pure 0
% 221.39/29.93 fd_pseudo 0
% 221.39/29.93 fd_cond 15
% 221.39/29.93 fd_pseudo_cond 14
% 221.39/29.93 AC symbols 0
% 221.39/29.93
% 221.39/29.93 ------ Schedule dynamic 5 is on
% 221.39/29.93
% 221.39/29.93 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93 ------
% 221.39/29.93 Current options:
% 221.39/29.93 ------
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93 ------ Proving...
% 221.39/29.93 Proof_search_loop: time out after: 12161 full_loop iterations
% 221.39/29.93
% 221.39/29.93 ------ Input Options"--res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93 ------
% 221.39/29.93 Current options:
% 221.39/29.93 ------
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93 ------ Proving...
% 221.39/29.93 Proof_search_loop: time out after: 16710 full_loop iterations
% 221.39/29.93
% 221.39/29.93 ------ Option_1: Negative Selections Time Limit: 35.
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93 ------
% 221.39/29.93 Current options:
% 221.39/29.93 ------
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93 ------ Proving...
% 221.39/29.93
% 221.39/29.93
% 221.39/29.93 % SZS status Unsatisfiable for theBenchmark.p
% 221.39/29.93
% 221.39/29.93 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 221.39/29.93
% 221.39/29.93
%------------------------------------------------------------------------------