TSTP Solution File: SWC408+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC408+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:12:23 EDT 2024
% Result : Theorem 3.92s 1.15s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 16 unt; 0 def)
% Number of atoms : 192 ( 43 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 212 ( 56 ~; 41 |; 95 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 25 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax36) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ( memberP(X0,X4)
| ~ memberP(X1,X4) ) )
| X0 != X2
| X1 != X3
| app(X3,X3) != 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)
=> ( ! [X4] :
( ssItem(X4)
=> ( memberP(X0,X4)
| ~ memberP(X1,X4) ) )
| X0 != X2
| X1 != X3
| app(X3,X3) != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f322,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f146]) ).
fof(f323,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f322]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(X1,X4)
& ssItem(X4) )
& sK53 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(X1,X4)
& ssItem(X4) )
& sK53 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
& sK53 = X2
& sK54 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
& sK53 = X2
& sK54 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
& sK53 = sK55
& sK54 = X3
& app(X3,X3) = sK55
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
& sK53 = sK55
& sK54 = X3
& app(X3,X3) = sK55
& ssList(X3) )
=> ( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
& sK53 = sK55
& sK54 = sK56
& sK55 = app(sK56,sK56)
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
=> ( ~ memberP(sK53,sK57)
& memberP(sK54,sK57)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ~ memberP(sK53,sK57)
& memberP(sK54,sK57)
& ssItem(sK57)
& sK53 = sK55
& sK54 = sK56
& sK55 = app(sK56,sK56)
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f222,f347,f346,f345,f344,f343]) ).
fof(f466,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f549,plain,
ssList(sK54),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
sK55 = app(sK56,sK56),
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
memberP(sK54,sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
~ memberP(sK53,sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
~ memberP(sK55,sK57),
inference(definition_unfolding,[],[f557,f554]) ).
fof(f559,plain,
memberP(sK56,sK57),
inference(definition_unfolding,[],[f556,f553]) ).
fof(f560,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f553]) ).
cnf(c_166,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X0,X2),X1) ),
inference(cnf_transformation,[],[f466]) ).
cnf(c_246,negated_conjecture,
~ memberP(sK55,sK57),
inference(cnf_transformation,[],[f558]) ).
cnf(c_247,negated_conjecture,
memberP(sK56,sK57),
inference(cnf_transformation,[],[f559]) ).
cnf(c_248,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f555]) ).
cnf(c_249,negated_conjecture,
app(sK56,sK56) = sK55,
inference(cnf_transformation,[],[f552]) ).
cnf(c_252,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f560]) ).
cnf(c_11673,plain,
( ~ memberP(sK56,X0)
| ~ ssItem(X0)
| ~ ssList(sK56)
| memberP(sK55,X0) ),
inference(superposition,[status(thm)],[c_249,c_166]) ).
cnf(c_11896,plain,
( ~ ssItem(X0)
| ~ memberP(sK56,X0)
| memberP(sK55,X0) ),
inference(global_subsumption_just,[status(thm)],[c_11673,c_252,c_11673]) ).
cnf(c_11897,plain,
( ~ memberP(sK56,X0)
| ~ ssItem(X0)
| memberP(sK55,X0) ),
inference(renaming,[status(thm)],[c_11896]) ).
cnf(c_11905,plain,
( ~ ssItem(sK57)
| memberP(sK55,sK57) ),
inference(superposition,[status(thm)],[c_247,c_11897]) ).
cnf(c_11906,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11905,c_246,c_248]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC408+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 23:37:03 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/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
% 3.92/1.15 % SZS status Started for theBenchmark.p
% 3.92/1.15 % SZS status Theorem for theBenchmark.p
% 3.92/1.15
% 3.92/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.92/1.15
% 3.92/1.15 ------ iProver source info
% 3.92/1.15
% 3.92/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.92/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.92/1.15 git: non_committed_changes: false
% 3.92/1.15
% 3.92/1.15 ------ Parsing...
% 3.92/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.92/1.15
% 3.92/1.15 ------ 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.92/1.15
% 3.92/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.92/1.15
% 3.92/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.92/1.15 ------ Proving...
% 3.92/1.15 ------ Problem Properties
% 3.92/1.15
% 3.92/1.15
% 3.92/1.15 clauses 186
% 3.92/1.15 conjectures 6
% 3.92/1.15 EPR 54
% 3.92/1.15 Horn 118
% 3.92/1.15 unary 22
% 3.92/1.15 binary 40
% 3.92/1.15 lits 624
% 3.92/1.15 lits eq 79
% 3.92/1.15 fd_pure 0
% 3.92/1.15 fd_pseudo 0
% 3.92/1.15 fd_cond 21
% 3.92/1.15 fd_pseudo_cond 14
% 3.92/1.15 AC symbols 0
% 3.92/1.15
% 3.92/1.15 ------ Input Options Time Limit: Unbounded
% 3.92/1.15
% 3.92/1.15
% 3.92/1.15 ------
% 3.92/1.15 Current options:
% 3.92/1.15 ------
% 3.92/1.15
% 3.92/1.15
% 3.92/1.15
% 3.92/1.15
% 3.92/1.15 ------ Proving...
% 3.92/1.15
% 3.92/1.15
% 3.92/1.15 % SZS status Theorem for theBenchmark.p
% 3.92/1.15
% 3.92/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.92/1.15
% 3.92/1.15
%------------------------------------------------------------------------------