TSTP Solution File: SWC006+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC006+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:10:50 EDT 2024
% Result : Theorem 4.32s 1.19s
% Output : CNFRefutation 4.32s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(X7,X9) != X2
| app(app(X7,X8),X9) != X3
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(X7,X9) != X2
| app(app(X7,X8),X9) != X3
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X4,X6) != X2
| app(app(X4,X5),X6) != X3
| ~ ssList(X6) ) ) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( app(X7,X9) = X0
& app(app(X7,X8),X9) = X1
& ssList(X9) )
& ssList(X8) )
& ssList(X7) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != X0
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != X0
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK53
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK53
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK53
| app(app(X7,X8),X9) != sK54
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK53
| app(app(X7,X8),X9) != sK54
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK55
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK53
| app(app(X7,X8),X9) != sK54
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK55
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK53
| app(app(X7,X8),X9) != sK54
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK55
& app(app(X4,X5),X6) = sK56
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK53
| app(app(X7,X8),X9) != sK54
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK55
& app(app(X4,X5),X6) = sK56
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ? [X6] :
( sK55 = app(sK57,X6)
& sK56 = app(app(sK57,X5),X6)
& ssList(X6) )
& ssList(X5) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X5] :
( ? [X6] :
( sK55 = app(sK57,X6)
& sK56 = app(app(sK57,X5),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( sK55 = app(sK57,X6)
& sK56 = app(app(sK57,sK58),X6)
& ssList(X6) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X6] :
( sK55 = app(sK57,X6)
& sK56 = app(app(sK57,sK58),X6)
& ssList(X6) )
=> ( sK55 = app(sK57,sK59)
& sK56 = app(app(sK57,sK58),sK59)
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( sK55 = app(sK57,sK59)
& sK56 = app(app(sK57,sK58),sK59)
& ssList(sK59)
& ssList(sK58)
& ssList(sK57)
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK53
| app(app(X7,X8),X9) != sK54
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59])],[f222,f349,f348,f347,f346,f345,f344,f343]) ).
fof(f554,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f350]) ).
fof(f555,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f350]) ).
fof(f556,plain,
! [X8,X9,X7] :
( app(X7,X9) != sK53
| app(app(X7,X8),X9) != sK54
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssList(X7) ),
inference(cnf_transformation,[],[f350]) ).
fof(f557,plain,
ssList(sK57),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
ssList(sK58),
inference(cnf_transformation,[],[f350]) ).
fof(f559,plain,
ssList(sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f560,plain,
sK56 = app(app(sK57,sK58),sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f561,plain,
sK55 = app(sK57,sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f562,plain,
! [X8,X9,X7] :
( app(X7,X9) != sK55
| app(app(X7,X8),X9) != sK56
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssList(X7) ),
inference(definition_unfolding,[],[f556,f555,f554]) ).
cnf(c_246,negated_conjecture,
app(sK57,sK59) = sK55,
inference(cnf_transformation,[],[f561]) ).
cnf(c_247,negated_conjecture,
app(app(sK57,sK58),sK59) = sK56,
inference(cnf_transformation,[],[f560]) ).
cnf(c_248,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f559]) ).
cnf(c_249,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f558]) ).
cnf(c_250,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f557]) ).
cnf(c_251,negated_conjecture,
( app(app(X0,X1),X2) != sK56
| app(X0,X2) != sK55
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_8830,plain,
app(sK57,sK58) = sP0_iProver_def,
definition ).
cnf(c_8831,plain,
app(sP0_iProver_def,sK59) = sP1_iProver_def,
definition ).
cnf(c_8832,plain,
app(sK57,sK59) = sP2_iProver_def,
definition ).
cnf(c_8835,negated_conjecture,
( app(app(X0,X1),X2) != sK56
| app(X0,X2) != sK55
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(demodulation,[status(thm)],[c_251]) ).
cnf(c_8836,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_250]) ).
cnf(c_8837,negated_conjecture,
ssList(sK58),
inference(demodulation,[status(thm)],[c_249]) ).
cnf(c_8838,negated_conjecture,
ssList(sK59),
inference(demodulation,[status(thm)],[c_248]) ).
cnf(c_8839,negated_conjecture,
sP1_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_247,c_8830,c_8831]) ).
cnf(c_8840,negated_conjecture,
sP2_iProver_def = sK55,
inference(demodulation,[status(thm)],[c_246,c_8832]) ).
cnf(c_11674,plain,
( app(app(X0,X1),X2) != sP1_iProver_def
| app(X0,X2) != sP2_iProver_def
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(light_normalisation,[status(thm)],[c_8835,c_8839,c_8840]) ).
cnf(c_11703,plain,
( app(sK57,X0) != sP2_iProver_def
| app(sP0_iProver_def,X0) != sP1_iProver_def
| ~ ssList(X0)
| ~ ssList(sK57)
| ~ ssList(sK58) ),
inference(superposition,[status(thm)],[c_8830,c_11674]) ).
cnf(c_11704,plain,
( app(sK57,X0) != sP2_iProver_def
| app(sP0_iProver_def,X0) != sP1_iProver_def
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11703,c_8837,c_8836]) ).
cnf(c_11772,plain,
( app(sK57,sK59) != sP2_iProver_def
| ~ ssList(sK59) ),
inference(superposition,[status(thm)],[c_8831,c_11704]) ).
cnf(c_11773,plain,
app(sK57,sK59) != sP2_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_11772,c_8838]) ).
cnf(c_11779,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11773,c_8832]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC006+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n002.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 23:53:42 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.32/1.19 % SZS status Started for theBenchmark.p
% 4.32/1.19 % SZS status Theorem for theBenchmark.p
% 4.32/1.19
% 4.32/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.32/1.19
% 4.32/1.19 ------ iProver source info
% 4.32/1.19
% 4.32/1.19 git: date: 2024-05-02 19:28:25 +0000
% 4.32/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.32/1.19 git: non_committed_changes: false
% 4.32/1.19
% 4.32/1.19 ------ Parsing...
% 4.32/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.32/1.19
% 4.32/1.19 ------ 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.32/1.19
% 4.32/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.32/1.19
% 4.32/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.32/1.19 ------ Proving...
% 4.32/1.19 ------ Problem Properties
% 4.32/1.19
% 4.32/1.19
% 4.32/1.19 clauses 191
% 4.32/1.19 conjectures 8
% 4.32/1.19 EPR 56
% 4.32/1.19 Horn 123
% 4.32/1.19 unary 26
% 4.32/1.19 binary 40
% 4.32/1.19 lits 633
% 4.32/1.19 lits eq 85
% 4.32/1.19 fd_pure 0
% 4.32/1.19 fd_pseudo 0
% 4.32/1.19 fd_cond 21
% 4.32/1.19 fd_pseudo_cond 14
% 4.32/1.19 AC symbols 0
% 4.32/1.19
% 4.32/1.19 ------ Schedule dynamic 5 is on
% 4.32/1.19
% 4.32/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.32/1.19
% 4.32/1.19
% 4.32/1.19 ------
% 4.32/1.19 Current options:
% 4.32/1.19 ------
% 4.32/1.19
% 4.32/1.19
% 4.32/1.19
% 4.32/1.19
% 4.32/1.19 ------ Proving...
% 4.32/1.19
% 4.32/1.19
% 4.32/1.19 % SZS status Theorem for theBenchmark.p
% 4.32/1.19
% 4.32/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.32/1.19
% 4.32/1.20
%------------------------------------------------------------------------------