TSTP Solution File: SWC094+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC094+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 : Fri May 3 03:11:12 EDT 2024
% Result : Theorem 4.17s 1.17s
% Output : CNFRefutation 4.17s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f592)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X1
& app(app(X4,X5),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X1
& app(app(X4,X5),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != sK53
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != sK53
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK54
| app(app(X4,X5),X6) != sK53
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK54
| app(app(X4,X5),X6) != sK53
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK54
| app(app(X4,X5),X6) != sK53
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK54
| app(app(X4,X5),X6) != sK53
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK54
| app(app(X4,X5),X6) != sK53
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK55 = sK56
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK54
| app(app(X4,X5),X6) != sK53
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK55 = sK56
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f222,f346,f345,f344,f343]) ).
fof(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f454,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f533,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
sK55 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK54
| app(app(X4,X5),X6) != sK53
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
sK53 = sK56,
inference(definition_unfolding,[],[f552,f553]) ).
fof(f556,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK56
| app(app(X4,X5),X6) != sK56
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f554,f551,f555]) ).
fof(f558,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f454]) ).
cnf(c_229,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(cnf_transformation,[],[f592]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f533]) ).
cnf(c_246,negated_conjecture,
( app(app(X0,X1),X2) != sK56
| app(X0,X2) != sK56
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_249,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f558]) ).
cnf(c_291,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_364,plain,
app(nil,nil) = nil,
inference(global_subsumption_just,[status(thm)],[c_229,c_141,c_291]) ).
cnf(c_8801,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_249]) ).
cnf(c_8802,negated_conjecture,
( app(app(X0,X1),X2) != sK56
| app(X0,X2) != sK56
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(demodulation,[status(thm)],[c_246]) ).
cnf(c_11603,plain,
( app(nil,X0) != sK56
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_364,c_8802]) ).
cnf(c_11604,plain,
( app(nil,X0) != sK56
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11603,c_141]) ).
cnf(c_11942,plain,
app(nil,sK56) = sK56,
inference(superposition,[status(thm)],[c_8801,c_155]) ).
cnf(c_12090,plain,
~ ssList(sK56),
inference(superposition,[status(thm)],[c_11942,c_11604]) ).
cnf(c_12091,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12090,c_8801]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC094+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n012.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:13:40 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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
% 4.17/1.17 % SZS status Started for theBenchmark.p
% 4.17/1.17 % SZS status Theorem for theBenchmark.p
% 4.17/1.17
% 4.17/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.17/1.17
% 4.17/1.17 ------ iProver source info
% 4.17/1.17
% 4.17/1.17 git: date: 2024-05-02 19:28:25 +0000
% 4.17/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.17/1.17 git: non_committed_changes: false
% 4.17/1.17
% 4.17/1.17 ------ Parsing...
% 4.17/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.17/1.17
% 4.17/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 4.17/1.17
% 4.17/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.17/1.17
% 4.17/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.17/1.17 ------ Proving...
% 4.17/1.17 ------ Problem Properties
% 4.17/1.17
% 4.17/1.17
% 4.17/1.17 clauses 182
% 4.17/1.17 conjectures 2
% 4.17/1.17 EPR 50
% 4.17/1.17 Horn 114
% 4.17/1.17 unary 17
% 4.17/1.17 binary 40
% 4.17/1.17 lits 624
% 4.17/1.17 lits eq 80
% 4.17/1.17 fd_pure 0
% 4.17/1.17 fd_pseudo 0
% 4.17/1.17 fd_cond 21
% 4.17/1.17 fd_pseudo_cond 14
% 4.17/1.17 AC symbols 0
% 4.17/1.17
% 4.17/1.17 ------ Schedule dynamic 5 is on
% 4.17/1.17
% 4.17/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.17/1.17
% 4.17/1.17
% 4.17/1.17 ------
% 4.17/1.17 Current options:
% 4.17/1.17 ------
% 4.17/1.17
% 4.17/1.17
% 4.17/1.17
% 4.17/1.17
% 4.17/1.17 ------ Proving...
% 4.17/1.17
% 4.17/1.17
% 4.17/1.17 % SZS status Theorem for theBenchmark.p
% 4.17/1.17
% 4.17/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.17/1.17
% 4.17/1.17
%------------------------------------------------------------------------------