TSTP Solution File: SWC328+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:42:34 EDT 2023
% Result : Theorem 3.20s 1.03s
% Output : CNFRefutation 3.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 13 unt; 0 def)
% Number of atoms : 134 ( 42 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 145 ( 41 ~; 24 |; 67 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 37 ( 0 sgn; 12 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax57) ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax74) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f175,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(X1,sK53) )
& sK53 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(X1,sK53) )
& sK53 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = X2
& sK54 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = X2
& sK54 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = sK55
& sK54 = X3
& nil = sK55
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = sK55
& sK54 = X3
& nil = sK55
& ssList(X3) )
=> ( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = sK55
& sK54 = sK56
& nil = sK55
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = sK55
& sK54 = sK56
& nil = sK55
& 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(f493,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f519,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f74]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
nil = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f347]) ).
fof(f573,plain,
! [X0] :
( segmentP(X0,sK55)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f493,f551]) ).
fof(f599,plain,
equalelemsP(sK55),
inference(definition_unfolding,[],[f519,f551]) ).
fof(f613,plain,
( ~ equalelemsP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(definition_unfolding,[],[f554,f553,f552,f553]) ).
fof(f614,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f552]) ).
cnf(c_194,negated_conjecture,
( ~ ssList(X0)
| segmentP(X0,sK55) ),
inference(cnf_transformation,[],[f573]) ).
cnf(c_218,negated_conjecture,
equalelemsP(sK55),
inference(cnf_transformation,[],[f599]) ).
cnf(c_246,negated_conjecture,
( ~ segmentP(sK56,sK55)
| ~ equalelemsP(sK55) ),
inference(cnf_transformation,[],[f613]) ).
cnf(c_249,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f614]) ).
cnf(c_363,negated_conjecture,
~ segmentP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_246,c_218,c_246]) ).
cnf(c_11555,plain,
~ ssList(sK56),
inference(superposition,[status(thm)],[c_194,c_363]) ).
cnf(c_11556,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11555,c_249]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.11 % Command : run_iprover %s %d THM
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Aug 28 16:45:16 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.16/0.39 Running first-order theorem proving
% 0.16/0.39 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.20/1.03 % SZS status Started for theBenchmark.p
% 3.20/1.03 % SZS status Theorem for theBenchmark.p
% 3.20/1.03
% 3.20/1.03 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.20/1.03
% 3.20/1.03 ------ iProver source info
% 3.20/1.03
% 3.20/1.03 git: date: 2023-05-31 18:12:56 +0000
% 3.20/1.03 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.20/1.03 git: non_committed_changes: false
% 3.20/1.03 git: last_make_outside_of_git: false
% 3.20/1.03
% 3.20/1.03 ------ Parsing...
% 3.20/1.03 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.20/1.03
% 3.20/1.03 ------ 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
% 3.20/1.03
% 3.20/1.03 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.20/1.03
% 3.20/1.03 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.20/1.03 ------ Proving...
% 3.20/1.03 ------ Problem Properties
% 3.20/1.03
% 3.20/1.03
% 3.20/1.03 clauses 182
% 3.20/1.03 conjectures 50
% 3.20/1.03 EPR 51
% 3.20/1.03 Horn 114
% 3.20/1.03 unary 18
% 3.20/1.03 binary 40
% 3.20/1.03 lits 620
% 3.20/1.03 lits eq 78
% 3.20/1.03 fd_pure 0
% 3.20/1.03 fd_pseudo 0
% 3.20/1.03 fd_cond 21
% 3.20/1.03 fd_pseudo_cond 14
% 3.20/1.03 AC symbols 0
% 3.20/1.03
% 3.20/1.03 ------ Schedule dynamic 5 is on
% 3.20/1.03
% 3.20/1.03 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.20/1.03
% 3.20/1.03
% 3.20/1.03 ------
% 3.20/1.03 Current options:
% 3.20/1.03 ------
% 3.20/1.03
% 3.20/1.03
% 3.20/1.03
% 3.20/1.03
% 3.20/1.03 ------ Proving...
% 3.20/1.03
% 3.20/1.03
% 3.20/1.03 % SZS status Theorem for theBenchmark.p
% 3.20/1.03
% 3.20/1.03 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.20/1.03
% 3.20/1.03
%------------------------------------------------------------------------------