TSTP Solution File: SET355+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET355+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:00:31 EDT 2024
% Result : Theorem 1.32s 1.10s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 7 unt; 0 def)
% Number of atoms : 109 ( 4 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 117 ( 46 ~; 38 |; 22 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 45 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f10,axiom,
! [X2,X0] :
( member(X2,sum(X0))
<=> ? [X4] :
( member(X2,X4)
& member(X4,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum) ).
fof(f12,conjecture,
! [X0,X2] :
( member(X2,X0)
=> subset(X2,sum(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI43) ).
fof(f13,negated_conjecture,
~ ! [X0,X2] :
( member(X2,X0)
=> subset(X2,sum(X0)) ),
inference(negated_conjecture,[],[f12]) ).
fof(f21,plain,
! [X0,X1] :
( member(X0,sum(X1))
<=> ? [X2] :
( member(X0,X2)
& member(X2,X1) ) ),
inference(rectify,[],[f10]) ).
fof(f23,plain,
~ ! [X0,X1] :
( member(X1,X0)
=> subset(X1,sum(X0)) ),
inference(rectify,[],[f13]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f26,plain,
? [X0,X1] :
( ~ subset(X1,sum(X0))
& member(X1,X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f27,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f28,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f28,f29]) ).
fof(f41,plain,
! [X0,X1] :
( ( member(X0,sum(X1))
| ! [X2] :
( ~ member(X0,X2)
| ~ member(X2,X1) ) )
& ( ? [X2] :
( member(X0,X2)
& member(X2,X1) )
| ~ member(X0,sum(X1)) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f42,plain,
! [X0,X1] :
( ( member(X0,sum(X1))
| ! [X2] :
( ~ member(X0,X2)
| ~ member(X2,X1) ) )
& ( ? [X3] :
( member(X0,X3)
& member(X3,X1) )
| ~ member(X0,sum(X1)) ) ),
inference(rectify,[],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( ? [X3] :
( member(X0,X3)
& member(X3,X1) )
=> ( member(X0,sK1(X0,X1))
& member(sK1(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f44,plain,
! [X0,X1] :
( ( member(X0,sum(X1))
| ! [X2] :
( ~ member(X0,X2)
| ~ member(X2,X1) ) )
& ( ( member(X0,sK1(X0,X1))
& member(sK1(X0,X1),X1) )
| ~ member(X0,sum(X1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f42,f43]) ).
fof(f49,plain,
( ? [X0,X1] :
( ~ subset(X1,sum(X0))
& member(X1,X0) )
=> ( ~ subset(sK4,sum(sK3))
& member(sK4,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
( ~ subset(sK4,sum(sK3))
& member(sK4,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f26,f49]) ).
fof(f52,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f53,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f73,plain,
! [X2,X0,X1] :
( member(X0,sum(X1))
| ~ member(X0,X2)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f77,plain,
member(sK4,sK3),
inference(cnf_transformation,[],[f50]) ).
fof(f78,plain,
~ subset(sK4,sum(sK3)),
inference(cnf_transformation,[],[f50]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_69,plain,
( ~ member(X0,X1)
| ~ member(X1,X2)
| member(X0,sum(X2)) ),
inference(cnf_transformation,[],[f73]) ).
cnf(c_75,negated_conjecture,
~ subset(sK4,sum(sK3)),
inference(cnf_transformation,[],[f78]) ).
cnf(c_76,negated_conjecture,
member(sK4,sK3),
inference(cnf_transformation,[],[f77]) ).
cnf(c_101,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_49]) ).
cnf(c_105,plain,
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(prop_impl_just,[status(thm)],[c_50]) ).
cnf(c_106,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(renaming,[status(thm)],[c_105]) ).
cnf(c_372,plain,
( sum(sK3) != X1
| X0 != sK4
| member(sK0(X0,X1),X0) ),
inference(resolution_lifted,[status(thm)],[c_106,c_75]) ).
cnf(c_373,plain,
member(sK0(sK4,sum(sK3)),sK4),
inference(unflattening,[status(thm)],[c_372]) ).
cnf(c_377,plain,
( sum(sK3) != X1
| X0 != sK4
| ~ member(sK0(X0,X1),X1) ),
inference(resolution_lifted,[status(thm)],[c_101,c_75]) ).
cnf(c_378,plain,
~ member(sK0(sK4,sum(sK3)),sum(sK3)),
inference(unflattening,[status(thm)],[c_377]) ).
cnf(c_1163,plain,
( ~ member(X0,sK4)
| ~ member(sK4,sK3)
| member(X0,sum(sK3)) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_1711,plain,
( ~ member(sK0(sK4,sum(sK3)),sK4)
| ~ member(sK4,sK3)
| member(sK0(sK4,sum(sK3)),sum(sK3)) ),
inference(instantiation,[status(thm)],[c_1163]) ).
cnf(c_1712,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1711,c_378,c_373,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SET355+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.07 % Command : run_iprover %s %d THM
% 0.06/0.25 % Computer : n022.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Thu May 2 20:17:12 EDT 2024
% 0.06/0.25 % CPUTime :
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 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
% 1.32/1.10 % SZS status Started for theBenchmark.p
% 1.32/1.10 % SZS status Theorem for theBenchmark.p
% 1.32/1.10
% 1.32/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.32/1.10
% 1.32/1.10 ------ iProver source info
% 1.32/1.10
% 1.32/1.10 git: date: 2024-05-02 19:28:25 +0000
% 1.32/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.32/1.10 git: non_committed_changes: false
% 1.32/1.10
% 1.32/1.10 ------ Parsing...
% 1.32/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.32/1.10
% 1.32/1.10 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.32/1.10
% 1.32/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.32/1.10
% 1.32/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.32/1.10 ------ Proving...
% 1.32/1.10 ------ Problem Properties
% 1.32/1.10
% 1.32/1.10
% 1.32/1.10 clauses 28
% 1.32/1.10 conjectures 2
% 1.32/1.10 EPR 3
% 1.32/1.10 Horn 23
% 1.32/1.10 unary 6
% 1.32/1.10 binary 15
% 1.32/1.10 lits 57
% 1.32/1.10 lits eq 3
% 1.32/1.10 fd_pure 0
% 1.32/1.10 fd_pseudo 0
% 1.32/1.10 fd_cond 0
% 1.32/1.10 fd_pseudo_cond 2
% 1.32/1.10 AC symbols 0
% 1.32/1.10
% 1.32/1.10 ------ Input Options Time Limit: Unbounded
% 1.32/1.10
% 1.32/1.10
% 1.32/1.10 ------
% 1.32/1.10 Current options:
% 1.32/1.10 ------
% 1.32/1.10
% 1.32/1.10
% 1.32/1.10
% 1.32/1.10
% 1.32/1.10 ------ Proving...
% 1.32/1.10
% 1.32/1.10
% 1.32/1.10 % SZS status Theorem for theBenchmark.p
% 1.32/1.10
% 1.32/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.32/1.10
% 1.32/1.10
%------------------------------------------------------------------------------