TSTP Solution File: SWC200-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC200-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:33 EDT 2024
% Result : Unsatisfiable 108.48s 15.26s
% Output : CNFRefutation 108.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of clauses : 60 ( 21 unt; 7 nHn; 53 RR)
% Number of literals : 146 ( 20 equ; 91 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 67 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(c_53,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(c_54,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(c_55,negated_conjecture,
singletonP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_57,negated_conjecture,
( ~ ssItem(X0)
| memberP(sk1,sk5(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(c_58,negated_conjecture,
( sk5(X0) != X0
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(c_66,plain,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_67,plain,
ssItem(skac3),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause9) ).
cnf(c_129,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_130,plain,
( ~ ssList(X0)
| ssItem(X1)
| duplicatefreeP(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(c_143,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(c_144,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_159,plain,
( ~ ssList(X0)
| ~ singletonP(X0)
| cons(skaf44(X0),nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(c_196,plain,
( X0 != X1
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(c_219,plain,
( ~ memberP(cons(X0,X1),X2)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(X2)
| X0 = X2
| memberP(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(c_237,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_255,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| memberP(cons(X1,X0),X1) ),
inference(unflattening,[status(thm)],[c_196]) ).
cnf(c_260,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_237]) ).
cnf(c_1522,plain,
singletonP(sk1),
inference(demodulation,[status(thm)],[c_55,c_54]) ).
cnf(c_6339,plain,
( ssItem(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_130]) ).
cnf(c_6340,plain,
( duplicatefreeP(X0)
| ~ ssList(X0)
| ~ sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_130]) ).
cnf(c_6341,plain,
( sP0_iProver_def
| sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_130]) ).
cnf(c_6342,negated_conjecture,
( sk5(X0) != X0
| ~ ssItem(X0) ),
inference(demodulation,[status(thm)],[c_58]) ).
cnf(c_6343,negated_conjecture,
( ~ ssItem(X0)
| memberP(sk1,sk5(X0)) ),
inference(demodulation,[status(thm)],[c_57]) ).
cnf(c_6346,negated_conjecture,
sk2 = sk4,
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_6348,negated_conjecture,
ssList(sk1),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_6357,plain,
( X0 != X1
| ~ duplicatefreeP(X1)
| duplicatefreeP(X0) ),
theory(equality) ).
cnf(c_13032,plain,
( ~ ssList(app(app(X0,cons(skac3,X1)),cons(skac3,X2)))
| ~ duplicatefreeP(app(app(X0,cons(skac3,X1)),cons(skac3,X2)))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(skac3) ),
inference(instantiation,[status(thm)],[c_260]) ).
cnf(c_13033,plain,
( ~ ssList(app(app(nil,cons(skac3,nil)),cons(skac3,nil)))
| ~ duplicatefreeP(app(app(nil,cons(skac3,nil)),cons(skac3,nil)))
| ~ ssList(nil)
| ~ ssItem(skac3) ),
inference(instantiation,[status(thm)],[c_13032]) ).
cnf(c_58314,plain,
( ~ ssList(X0)
| ~ ssItem(skac3)
| ssList(cons(skac3,X0)) ),
inference(instantiation,[status(thm)],[c_144]) ).
cnf(c_58315,plain,
( ~ ssList(nil)
| ~ ssItem(skac3)
| ssList(cons(skac3,nil)) ),
inference(instantiation,[status(thm)],[c_58314]) ).
cnf(c_250226,plain,
( ~ ssList(app(X0,cons(skac3,X1)))
| ~ ssList(cons(skac3,X2))
| ssList(app(app(X0,cons(skac3,X1)),cons(skac3,X2))) ),
inference(instantiation,[status(thm)],[c_143]) ).
cnf(c_250227,plain,
( ~ ssList(app(nil,cons(skac3,nil)))
| ~ ssList(cons(skac3,nil))
| ssList(app(app(nil,cons(skac3,nil)),cons(skac3,nil))) ),
inference(instantiation,[status(thm)],[c_250226]) ).
cnf(c_254720,plain,
( ~ ssList(cons(skac3,X0))
| ~ ssList(X1)
| ssList(app(X1,cons(skac3,X0))) ),
inference(instantiation,[status(thm)],[c_143]) ).
cnf(c_254721,plain,
( ~ ssList(cons(skac3,nil))
| ~ ssList(nil)
| ssList(app(nil,cons(skac3,nil))) ),
inference(instantiation,[status(thm)],[c_254720]) ).
cnf(c_306554,plain,
( ~ ssList(app(app(X0,cons(skac3,X1)),cons(skac3,X2)))
| ~ sP1_iProver_def
| duplicatefreeP(app(app(X0,cons(skac3,X1)),cons(skac3,X2))) ),
inference(instantiation,[status(thm)],[c_6340]) ).
cnf(c_306555,plain,
( ~ ssList(app(app(nil,cons(skac3,nil)),cons(skac3,nil)))
| ~ sP1_iProver_def
| duplicatefreeP(app(app(nil,cons(skac3,nil)),cons(skac3,nil))) ),
inference(instantiation,[status(thm)],[c_306554]) ).
cnf(c_306938,plain,
( ~ duplicatefreeP(sk4)
| duplicatefreeP(sk2) ),
inference(resolution,[status(thm)],[c_6357,c_6346]) ).
cnf(c_309030,plain,
( ~ ssList(sk4)
| ~ sP1_iProver_def
| duplicatefreeP(sk2) ),
inference(resolution,[status(thm)],[c_306938,c_6340]) ).
cnf(c_312547,plain,
~ sP1_iProver_def,
inference(global_subsumption_just,[status(thm)],[c_309030,c_67,c_66,c_13033,c_58315,c_250227,c_254721,c_306555]) ).
cnf(c_312583,plain,
sP0_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_6341,c_312547]) ).
cnf(c_312586,plain,
ssItem(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_6339,c_312583]) ).
cnf(c_312623,plain,
( ~ memberP(cons(X0,X1),X2)
| ~ ssList(X1)
| ~ ssItem(X2)
| X0 = X2
| memberP(X1,X2) ),
inference(backward_subsumption_resolution,[status(thm)],[c_219,c_312586]) ).
cnf(c_312638,plain,
( ~ ssList(X0)
| memberP(cons(X1,X0),X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_255,c_312586]) ).
cnf(c_318962,plain,
( ~ memberP(cons(X0,X1),X2)
| ~ ssList(X1)
| X0 = X2
| memberP(X1,X2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_312623,c_312586]) ).
cnf(c_377825,negated_conjecture,
memberP(sk1,sk5(X0)),
inference(global_subsumption_just,[status(thm)],[c_6343,c_67,c_66,c_57,c_6339,c_6341,c_13033,c_58315,c_250227,c_254721,c_306555]) ).
cnf(c_377827,negated_conjecture,
sk5(X0) != X0,
inference(global_subsumption_just,[status(thm)],[c_6342,c_67,c_66,c_58,c_6339,c_6341,c_13033,c_58315,c_250227,c_254721,c_306555]) ).
cnf(c_377839,plain,
~ memberP(nil,X0),
inference(global_subsumption_just,[status(thm)],[c_129,c_67,c_66,c_129,c_6339,c_6341,c_13033,c_58315,c_250227,c_254721,c_306555]) ).
cnf(c_377923,plain,
( ~ ssList(sk1)
| cons(skaf44(sk1),nil) = sk1 ),
inference(superposition,[status(thm)],[c_1522,c_159]) ).
cnf(c_377924,plain,
cons(skaf44(sk1),nil) = sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_377923,c_6348]) ).
cnf(c_378100,plain,
( ~ ssList(X0)
| memberP(cons(X1,X0),X1) ),
inference(global_subsumption_just,[status(thm)],[c_255,c_312638]) ).
cnf(c_378106,plain,
( ~ ssList(nil)
| memberP(sk1,skaf44(sk1)) ),
inference(superposition,[status(thm)],[c_377924,c_378100]) ).
cnf(c_378107,plain,
memberP(sk1,skaf44(sk1)),
inference(forward_subsumption_resolution,[status(thm)],[c_378106,c_66]) ).
cnf(c_383848,plain,
( ~ memberP(cons(X0,X1),X2)
| ~ ssList(X1)
| X0 = X2
| memberP(X1,X2) ),
inference(global_subsumption_just,[status(thm)],[c_219,c_318962]) ).
cnf(c_383861,plain,
( ~ memberP(sk1,X0)
| ~ ssList(nil)
| skaf44(sk1) = X0
| memberP(nil,X0) ),
inference(superposition,[status(thm)],[c_377924,c_383848]) ).
cnf(c_383870,plain,
( ~ memberP(sk1,X0)
| skaf44(sk1) = X0 ),
inference(forward_subsumption_resolution,[status(thm)],[c_383861,c_377839,c_66]) ).
cnf(c_383917,plain,
sk5(X0) = skaf44(sk1),
inference(superposition,[status(thm)],[c_377825,c_383870]) ).
cnf(c_384026,plain,
skaf44(sk1) != X0,
inference(superposition,[status(thm)],[c_383917,c_377827]) ).
cnf(c_384041,plain,
~ memberP(sk1,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_383870,c_384026]) ).
cnf(c_384042,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_378107,c_384041]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC200-1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 23:14:19 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 108.48/15.26 % SZS status Started for theBenchmark.p
% 108.48/15.26 % SZS status Unsatisfiable for theBenchmark.p
% 108.48/15.26
% 108.48/15.26 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 108.48/15.26
% 108.48/15.26 ------ iProver source info
% 108.48/15.26
% 108.48/15.26 git: date: 2024-05-02 19:28:25 +0000
% 108.48/15.26 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 108.48/15.26 git: non_committed_changes: false
% 108.48/15.26
% 108.48/15.26 ------ Parsing...successful
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26 ------ Preprocessing... sup_sim: 5 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
% 108.48/15.26
% 108.48/15.26 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 108.48/15.26
% 108.48/15.26 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 108.48/15.26 ------ Proving...
% 108.48/15.26 ------ Problem Properties
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26 clauses 185
% 108.48/15.26 conjectures 7
% 108.48/15.26 EPR 57
% 108.48/15.26 Horn 157
% 108.48/15.26 unary 63
% 108.48/15.26 binary 24
% 108.48/15.26 lits 552
% 108.48/15.26 lits eq 72
% 108.48/15.26 fd_pure 0
% 108.48/15.26 fd_pseudo 0
% 108.48/15.26 fd_cond 15
% 108.48/15.26 fd_pseudo_cond 14
% 108.48/15.26 AC symbols 0
% 108.48/15.26
% 108.48/15.26 ------ Schedule dynamic 5 is on
% 108.48/15.26
% 108.48/15.26 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26 ------
% 108.48/15.26 Current options:
% 108.48/15.26 ------
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26 ------ Proving...
% 108.48/15.26 Proof_search_loop: time out after: 9844 full_loop iterations
% 108.48/15.26
% 108.48/15.26 ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26 ------
% 108.48/15.26 Current options:
% 108.48/15.26 ------
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26 ------ Proving...
% 108.48/15.26
% 108.48/15.26
% 108.48/15.26 % SZS status Unsatisfiable for theBenchmark.p
% 108.48/15.26
% 108.48/15.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 108.48/15.26
% 108.48/15.27
%------------------------------------------------------------------------------