TSTP Solution File: SET899+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET899+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:01:56 EDT 2024
% Result : Theorem 1.90s 1.17s
% Output : CNFRefutation 1.90s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f5,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t40_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f7,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_zfmisc_1) ).
fof(f10,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_difference(X1,singleton(X2)))
& ~ in(X2,X0)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f11,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_difference(X1,singleton(X2)))
& ~ in(X2,X0)
& subset(X0,X1) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1,X2] :
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
! [X0,X1,X2] :
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f12]) ).
fof(f18,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,set_difference(X1,singleton(X2)))
& ~ in(X2,X0)
& subset(X0,X1) )
=> ( ~ subset(sK2,set_difference(sK3,singleton(sK4)))
& ~ in(sK4,sK2)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
( ~ subset(sK2,set_difference(sK3,singleton(sK4)))
& ~ in(sK4,sK2)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f11,f18]) ).
fof(f24,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f25,plain,
~ in(sK4,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f26,plain,
~ subset(sK2,set_difference(sK3,singleton(sK4))),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
! [X2,X0,X1] :
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_53,negated_conjecture,
~ subset(sK2,set_difference(sK3,singleton(sK4))),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,negated_conjecture,
~ in(sK4,sK2),
inference(cnf_transformation,[],[f25]) ).
cnf(c_55,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f24]) ).
cnf(c_56,plain,
( ~ subset(X0,X1)
| subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_100,plain,
singleton(sK4) = sP0_iProver_def,
definition ).
cnf(c_101,plain,
set_difference(sK3,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_104,negated_conjecture,
~ subset(sK2,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_53,c_100,c_101]) ).
cnf(c_238,plain,
( ~ subset(X0,X1)
| subset(X0,set_difference(X1,sP0_iProver_def))
| in(sK4,X0) ),
inference(superposition,[status(thm)],[c_100,c_56]) ).
cnf(c_249,plain,
( ~ subset(X0,sK3)
| subset(X0,sP1_iProver_def)
| in(sK4,X0) ),
inference(superposition,[status(thm)],[c_101,c_238]) ).
cnf(c_253,plain,
( ~ subset(sK2,sK3)
| subset(sK2,sP1_iProver_def)
| in(sK4,sK2) ),
inference(instantiation,[status(thm)],[c_249]) ).
cnf(c_254,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_253,c_104,c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET899+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 20:12:48 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.90/1.17 % SZS status Started for theBenchmark.p
% 1.90/1.17 % SZS status Theorem for theBenchmark.p
% 1.90/1.17
% 1.90/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.90/1.17
% 1.90/1.17 ------ iProver source info
% 1.90/1.17
% 1.90/1.17 git: date: 2024-05-02 19:28:25 +0000
% 1.90/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.90/1.17 git: non_committed_changes: false
% 1.90/1.17
% 1.90/1.17 ------ Parsing...
% 1.90/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.90/1.17
% 1.90/1.17 ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.90/1.17
% 1.90/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.90/1.17
% 1.90/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.90/1.17 ------ Proving...
% 1.90/1.17 ------ Problem Properties
% 1.90/1.17
% 1.90/1.17
% 1.90/1.17 clauses 8
% 1.90/1.17 conjectures 3
% 1.90/1.17 EPR 5
% 1.90/1.17 Horn 7
% 1.90/1.17 unary 6
% 1.90/1.17 binary 1
% 1.90/1.17 lits 11
% 1.90/1.17 lits eq 2
% 1.90/1.17 fd_pure 0
% 1.90/1.17 fd_pseudo 0
% 1.90/1.17 fd_cond 0
% 1.90/1.17 fd_pseudo_cond 0
% 1.90/1.17 AC symbols 0
% 1.90/1.17
% 1.90/1.17 ------ Schedule dynamic 5 is on
% 1.90/1.17
% 1.90/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.90/1.17
% 1.90/1.17
% 1.90/1.17 ------
% 1.90/1.17 Current options:
% 1.90/1.17 ------
% 1.90/1.17
% 1.90/1.17
% 1.90/1.17
% 1.90/1.17
% 1.90/1.17 ------ Proving...
% 1.90/1.17
% 1.90/1.17
% 1.90/1.17 % SZS status Theorem for theBenchmark.p
% 1.90/1.17
% 1.90/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.90/1.17
% 1.90/1.17
%------------------------------------------------------------------------------