TSTP Solution File: SWC102+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC102+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 : Thu Aug 31 20:41:00 EDT 2023
% Result : Theorem 3.75s 1.18s
% Output : CNFRefutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 13 unt; 0 def)
% Number of atoms : 145 ( 43 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 158 ( 42 ~; 25 |; 78 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 36 ( 0 sgn; 11 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil)
| 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)
=> ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil)
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f153,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil)
& 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] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil)
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil)
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,sK53)
| ~ neq(sK53,nil) )
& neq(X1,nil)
& X2 = X3
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,sK53)
| ~ neq(sK53,nil) )
& neq(X1,nil)
& X2 = X3
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil)
& X2 = X3
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil)
& X2 = X3
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil)
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil)
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil)
& sK55 = sK56
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil)
& 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(f474,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f153]) ).
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,
neq(sK54,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
sK53 = sK56,
inference(definition_unfolding,[],[f552,f553]) ).
fof(f557,plain,
( ~ frontsegP(sK56,sK56)
| ~ neq(sK56,nil) ),
inference(definition_unfolding,[],[f555,f551,f556,f556]) ).
fof(f558,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f554,f551]) ).
fof(f560,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
cnf(c_175,plain,
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(cnf_transformation,[],[f474]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| ~ frontsegP(sK56,sK56) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_247,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f558]) ).
cnf(c_250,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f560]) ).
cnf(c_364,negated_conjecture,
~ frontsegP(sK56,sK56),
inference(global_subsumption_just,[status(thm)],[c_246,c_247,c_246]) ).
cnf(c_11637,plain,
~ ssList(sK56),
inference(superposition,[status(thm)],[c_175,c_364]) ).
cnf(c_11638,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11637,c_250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC102+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 16:42:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.75/1.18 % SZS status Started for theBenchmark.p
% 3.75/1.18 % SZS status Theorem for theBenchmark.p
% 3.75/1.18
% 3.75/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.75/1.18
% 3.75/1.18 ------ iProver source info
% 3.75/1.18
% 3.75/1.18 git: date: 2023-05-31 18:12:56 +0000
% 3.75/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.75/1.18 git: non_committed_changes: false
% 3.75/1.18 git: last_make_outside_of_git: false
% 3.75/1.18
% 3.75/1.18 ------ Parsing...
% 3.75/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.75/1.18
% 3.75/1.18 ------ 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: 5 0s sf_e pe_s pe_e
% 3.75/1.18
% 3.75/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.75/1.18
% 3.75/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.75/1.18 ------ Proving...
% 3.75/1.18 ------ Problem Properties
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18 clauses 183
% 3.75/1.18 conjectures 2
% 3.75/1.18 EPR 52
% 3.75/1.18 Horn 115
% 3.75/1.18 unary 19
% 3.75/1.18 binary 40
% 3.75/1.18 lits 621
% 3.75/1.18 lits eq 79
% 3.75/1.18 fd_pure 0
% 3.75/1.18 fd_pseudo 0
% 3.75/1.18 fd_cond 21
% 3.75/1.18 fd_pseudo_cond 14
% 3.75/1.18 AC symbols 0
% 3.75/1.18
% 3.75/1.18 ------ Schedule dynamic 5 is on
% 3.75/1.18
% 3.75/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18 ------
% 3.75/1.18 Current options:
% 3.75/1.18 ------
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18 ------ Proving...
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18 % SZS status Theorem for theBenchmark.p
% 3.75/1.18
% 3.75/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.75/1.18
% 3.75/1.18
%------------------------------------------------------------------------------