TSTP Solution File: SWC223-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC223-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:39 EDT 2024
% Result : Unsatisfiable 123.29s 17.05s
% Output : CNFRefutation 123.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 54 ( 15 unt; 6 nHn; 43 RR)
% Number of literals : 138 ( 28 equ; 88 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 : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 80 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(c_55,negated_conjecture,
sk1 != nil,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(c_70,plain,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_75,plain,
ssList(skaf82(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(c_133,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_134,plain,
( ~ ssList(X0)
| ssItem(X1)
| duplicatefreeP(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(c_136,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(c_140,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause78) ).
cnf(c_147,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(c_148,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)
| hd(cons(X1,X0)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(c_171,plain,
( ~ ssList(X0)
| cons(skaf83(X0),skaf82(X0)) = X0
| X0 = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(c_182,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_241,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_264,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_241]) ).
cnf(c_6583,plain,
( ssItem(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_134]) ).
cnf(c_6584,plain,
( duplicatefreeP(X0)
| ~ ssList(X0)
| ~ sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_134]) ).
cnf(c_6585,plain,
( sP0_iProver_def
| sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_134]) ).
cnf(c_9231,plain,
( ~ ssList(sk1)
| sk1 = nil
| ssItem(hd(sk1)) ),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_9568,plain,
( ~ ssList(cons(X0,X1))
| ~ ssList(X2)
| ssList(app(X2,cons(X0,X1))) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_11240,plain,
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(cons(X1,X3))
| ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(instantiation,[status(thm)],[c_9568]) ).
cnf(c_14390,plain,
( ~ ssItem(hd(sk1))
| ~ ssList(X0)
| ssList(cons(hd(sk1),X0)) ),
inference(instantiation,[status(thm)],[c_148]) ).
cnf(c_14391,plain,
( ~ ssItem(hd(sk1))
| ~ ssList(nil)
| ssList(cons(hd(sk1),nil)) ),
inference(instantiation,[status(thm)],[c_14390]) ).
cnf(c_21674,plain,
( ~ ssList(cons(hd(sk1),X0))
| ~ ssList(X1)
| ssList(app(X1,cons(hd(sk1),X0))) ),
inference(instantiation,[status(thm)],[c_9568]) ).
cnf(c_21677,plain,
( ~ ssList(cons(hd(sk1),nil))
| ~ ssList(nil)
| ssList(app(nil,cons(hd(sk1),nil))) ),
inference(instantiation,[status(thm)],[c_21674]) ).
cnf(c_21705,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_11240]) ).
cnf(c_21706,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_21705]) ).
cnf(c_74266,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_264]) ).
cnf(c_74278,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_74266]) ).
cnf(c_83873,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_6584]) ).
cnf(c_83874,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_83873]) ).
cnf(c_112136,plain,
sP0_iProver_def,
inference(global_subsumption_just,[status(thm)],[c_6585,c_49,c_70,c_55,c_6585,c_9231,c_14391,c_21677,c_21706,c_74278,c_83874]) ).
cnf(c_112138,plain,
ssItem(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_6583,c_112136]) ).
cnf(c_112203,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_112138]) ).
cnf(c_256177,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_112203]) ).
cnf(c_256178,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_256177]) ).
cnf(c_256223,plain,
( ~ ssList(X0)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_182,c_112138]) ).
cnf(c_256233,plain,
( ~ ssList(X0)
| hd(cons(X1,X0)) = X1 ),
inference(backward_subsumption_resolution,[status(thm)],[c_159,c_112138]) ).
cnf(c_256235,plain,
( ~ ssList(X0)
| ssList(cons(X1,X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_148,c_112138]) ).
cnf(c_256236,plain,
~ memberP(nil,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_133,c_112138]) ).
cnf(c_256378,plain,
( ~ ssList(X0)
| app(nil,cons(X1,X0)) = cons(X1,X0) ),
inference(superposition,[status(thm)],[c_256235,c_136]) ).
cnf(c_256579,plain,
app(cons(X0,nil),skaf82(X1)) = cons(X0,skaf82(X1)),
inference(superposition,[status(thm)],[c_75,c_256223]) ).
cnf(c_256711,plain,
app(nil,cons(X0,nil)) = cons(X0,nil),
inference(superposition,[status(thm)],[c_70,c_256378]) ).
cnf(c_257046,plain,
( cons(skaf83(sk1),skaf82(sk1)) = sk1
| sk1 = nil ),
inference(superposition,[status(thm)],[c_49,c_171]) ).
cnf(c_257080,plain,
cons(skaf83(sk1),skaf82(sk1)) = sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_257046,c_55]) ).
cnf(c_269962,plain,
hd(cons(X0,skaf82(X1))) = X0,
inference(superposition,[status(thm)],[c_75,c_256233]) ).
cnf(c_270127,plain,
skaf83(sk1) = hd(sk1),
inference(superposition,[status(thm)],[c_257080,c_269962]) ).
cnf(c_270131,plain,
cons(hd(sk1),skaf82(sk1)) = sk1,
inference(demodulation,[status(thm)],[c_257080,c_270127]) ).
cnf(c_274668,plain,
( app(cons(X0,nil),X1) != sk1
| ~ ssList(X1)
| ~ ssList(nil)
| memberP(nil,sk5(X1,nil,X0)) ),
inference(superposition,[status(thm)],[c_256711,c_256178]) ).
cnf(c_274690,plain,
( app(cons(X0,nil),X1) != sk1
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_274668,c_256236,c_70]) ).
cnf(c_286839,plain,
( cons(X0,skaf82(X1)) != sk1
| ~ ssList(skaf82(X1)) ),
inference(superposition,[status(thm)],[c_256579,c_274690]) ).
cnf(c_286842,plain,
cons(X0,skaf82(X1)) != sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_286839,c_75]) ).
cnf(c_286861,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_270131,c_286842]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : SWC223-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.07 % Command : run_iprover %s %d THM
% 0.06/0.26 % Computer : n024.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Thu May 2 23:28:20 EDT 2024
% 0.06/0.26 % CPUTime :
% 0.10/0.34 Running first-order theorem proving
% 0.10/0.34 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
% 123.29/17.05 % SZS status Started for theBenchmark.p
% 123.29/17.05 % SZS status Unsatisfiable for theBenchmark.p
% 123.29/17.05
% 123.29/17.05 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 123.29/17.05
% 123.29/17.05 ------ iProver source info
% 123.29/17.05
% 123.29/17.05 git: date: 2024-05-02 19:28:25 +0000
% 123.29/17.05 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 123.29/17.05 git: non_committed_changes: false
% 123.29/17.05
% 123.29/17.05 ------ Parsing...successful
% 123.29/17.05
% 123.29/17.05
% 123.29/17.05
% 123.29/17.05 ------ Preprocessing... sup_sim: 6 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
% 123.29/17.05
% 123.29/17.05 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 123.29/17.05
% 123.29/17.05 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 123.29/17.05 ------ Proving...
% 123.29/17.05 ------ Problem Properties
% 123.29/17.05
% 123.29/17.05
% 123.29/17.05 clauses 189
% 123.29/17.05 conjectures 10
% 123.29/17.05 EPR 57
% 123.29/17.05 Horn 161
% 123.29/17.05 unary 63
% 123.29/17.05 binary 21
% 123.29/17.05 lits 585
% 123.29/17.05 lits eq 79
% 123.29/17.05 fd_pure 0
% 123.29/17.05 fd_pseudo 0
% 123.29/17.05 fd_cond 15
% 123.29/17.05 fd_pseudo_cond 14
% 123.29/17.05 AC symbols 0
% 123.29/17.05
% 123.29/17.05 ------ Input Options Time Limit: Unbounded
% 123.29/17.05
% 123.29/17.05
% 123.29/17.05 ------
% 123.29/17.05 Current options:
% 123.29/17.05 ------
% 123.29/17.05
% 123.29/17.05
% 123.29/17.05
% 123.29/17.05
% 123.29/17.05 ------ Proving...
% 123.29/17.05
% 123.29/17.05
% 123.29/17.05 % SZS status Unsatisfiable for theBenchmark.p
% 123.29/17.05
% 123.29/17.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 123.29/17.05
% 123.29/17.06
%------------------------------------------------------------------------------