TSTP Solution File: SWC391+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC391+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:12:18 EDT 2024
% Result : Theorem 0.97s 1.12s
% Output : CNFRefutation 0.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 135 ( 43 equ)
% Maximal formula atoms : 20 ( 6 avg)
% Number of connectives : 139 ( 25 ~; 8 |; 91 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 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 : 45 ( 0 sgn 10 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ( memberP(X1,X4)
| ~ memberP(X0,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] :
( ssItem(X4)
=> ( memberP(X1,X4)
| ~ memberP(X0,X4) ) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(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] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(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] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK53,X4)
& ssItem(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] :
( ~ memberP(X1,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& X2 = X3
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& X2 = X3
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& X2 = X3
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& sK55 = sK56
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
=> ( ~ memberP(sK54,sK57)
& memberP(sK53,sK57)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ~ memberP(sK54,sK57)
& memberP(sK53,sK57)
& ssItem(sK57)
& 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,sK57])],[f222,f347,f346,f345,f344,f343]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
sK55 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
memberP(sK53,sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
~ memberP(sK54,sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
sK53 = sK56,
inference(definition_unfolding,[],[f553,f554]) ).
fof(f559,plain,
~ memberP(sK56,sK57),
inference(definition_unfolding,[],[f557,f552]) ).
fof(f560,plain,
memberP(sK56,sK57),
inference(definition_unfolding,[],[f556,f558]) ).
cnf(c_246,negated_conjecture,
~ memberP(sK56,sK57),
inference(cnf_transformation,[],[f559]) ).
cnf(c_247,negated_conjecture,
memberP(sK56,sK57),
inference(cnf_transformation,[],[f560]) ).
cnf(c_253,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_246,c_247]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC391+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n002.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 23:51:42 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 0.97/1.12 % SZS status Started for theBenchmark.p
% 0.97/1.12 % SZS status Theorem for theBenchmark.p
% 0.97/1.12
% 0.97/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.97/1.12
% 0.97/1.12 ------ iProver source info
% 0.97/1.12
% 0.97/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.97/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.97/1.12 git: non_committed_changes: false
% 0.97/1.12
% 0.97/1.12 ------ Parsing...
% 0.97/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.97/1.12
% 0.97/1.12 ------ Preprocessing...
% 0.97/1.12
% 0.97/1.12 % SZS status Theorem for theBenchmark.p
% 0.97/1.12
% 0.97/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.97/1.12
% 0.97/1.12
%------------------------------------------------------------------------------