TSTP Solution File: SET589+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET589+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:51 EDT 2024
% Result : Theorem 2.01s 1.12s
% Output : CNFRefutation 2.01s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f7,conjecture,
! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(difference(X0,X3),difference(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th48) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(difference(X0,X3),difference(X1,X2)) ),
inference(negated_conjecture,[],[f7]) ).
fof(f13,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f14,plain,
? [X0,X1,X2,X3] :
( ~ subset(difference(X0,X3),difference(X1,X2))
& subset(X2,X3)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f15,plain,
? [X0,X1,X2,X3] :
( ~ subset(difference(X0,X3),difference(X1,X2))
& subset(X2,X3)
& subset(X0,X1) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f16]) ).
fof(f18,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,[],[f13]) ).
fof(f19,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,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,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])],[f19,f20]) ).
fof(f22,plain,
( ? [X0,X1,X2,X3] :
( ~ subset(difference(X0,X3),difference(X1,X2))
& subset(X2,X3)
& subset(X0,X1) )
=> ( ~ subset(difference(sK1,sK4),difference(sK2,sK3))
& subset(sK3,sK4)
& subset(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
( ~ subset(difference(sK1,sK4),difference(sK2,sK3))
& subset(sK3,sK4)
& subset(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f15,f22]) ).
fof(f27,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f29,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f30,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f31,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f32,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f34,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f23]) ).
fof(f35,plain,
subset(sK3,sK4),
inference(cnf_transformation,[],[f23]) ).
fof(f36,plain,
~ subset(difference(sK1,sK4),difference(sK2,sK3)),
inference(cnf_transformation,[],[f23]) ).
cnf(c_52,plain,
( ~ member(X0,X1)
| member(X0,difference(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_53,plain,
( ~ member(X0,difference(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_54,plain,
( ~ member(X0,difference(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_55,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_56,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_57,plain,
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_59,negated_conjecture,
~ subset(difference(sK1,sK4),difference(sK2,sK3)),
inference(cnf_transformation,[],[f36]) ).
cnf(c_60,negated_conjecture,
subset(sK3,sK4),
inference(cnf_transformation,[],[f35]) ).
cnf(c_61,negated_conjecture,
subset(sK1,sK2),
inference(cnf_transformation,[],[f34]) ).
cnf(c_116,plain,
difference(sK1,sK4) = sP0_iProver_def,
definition ).
cnf(c_117,plain,
difference(sK2,sK3) = sP1_iProver_def,
definition ).
cnf(c_118,negated_conjecture,
subset(sK1,sK2),
inference(demodulation,[status(thm)],[c_61]) ).
cnf(c_119,negated_conjecture,
subset(sK3,sK4),
inference(demodulation,[status(thm)],[c_60]) ).
cnf(c_120,negated_conjecture,
~ subset(sP0_iProver_def,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_59,c_117,c_116]) ).
cnf(c_307,plain,
( ~ member(X0,sP0_iProver_def)
| member(X0,sK1) ),
inference(superposition,[status(thm)],[c_116,c_54]) ).
cnf(c_342,plain,
( ~ member(X0,sK4)
| ~ member(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_116,c_53]) ).
cnf(c_405,plain,
( member(sK0(sP0_iProver_def,X0),sK1)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_56,c_307]) ).
cnf(c_433,plain,
( ~ member(sK0(sP0_iProver_def,X0),sK4)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_56,c_342]) ).
cnf(c_502,plain,
( ~ member(X0,sK3)
| member(X0,sK4) ),
inference(superposition,[status(thm)],[c_119,c_57]) ).
cnf(c_503,plain,
( ~ member(X0,sK1)
| member(X0,sK2) ),
inference(superposition,[status(thm)],[c_118,c_57]) ).
cnf(c_541,plain,
( ~ member(X0,sK2)
| member(X0,sK3)
| member(X0,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_117,c_52]) ).
cnf(c_578,plain,
( member(sK0(sP0_iProver_def,X0),sK2)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_405,c_503]) ).
cnf(c_831,plain,
( member(sK0(sP0_iProver_def,X0),sK3)
| member(sK0(sP0_iProver_def,X0),sP1_iProver_def)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_578,c_541]) ).
cnf(c_1316,plain,
( member(sK0(sP0_iProver_def,X0),sK4)
| member(sK0(sP0_iProver_def,X0),sP1_iProver_def)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_831,c_502]) ).
cnf(c_1329,plain,
( member(sK0(sP0_iProver_def,X0),sP1_iProver_def)
| subset(sP0_iProver_def,X0) ),
inference(global_subsumption_just,[status(thm)],[c_1316,c_433,c_1316]) ).
cnf(c_1335,plain,
subset(sP0_iProver_def,sP1_iProver_def),
inference(superposition,[status(thm)],[c_1329,c_55]) ).
cnf(c_1338,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1335,c_120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.10 % Problem : SET589+3 : TPTP v8.1.2. Released v2.2.0.
% 0.01/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n029.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 20:47:07 EDT 2024
% 0.10/0.32 % 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
% 2.01/1.12 % SZS status Started for theBenchmark.p
% 2.01/1.12 % SZS status Theorem for theBenchmark.p
% 2.01/1.12
% 2.01/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.01/1.12
% 2.01/1.12 ------ iProver source info
% 2.01/1.12
% 2.01/1.12 git: date: 2024-05-02 19:28:25 +0000
% 2.01/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.01/1.12 git: non_committed_changes: false
% 2.01/1.12
% 2.01/1.12 ------ Parsing...
% 2.01/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.01/1.12
% 2.01/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.01/1.12
% 2.01/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.01/1.12
% 2.01/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.01/1.12 ------ Proving...
% 2.01/1.12 ------ Problem Properties
% 2.01/1.12
% 2.01/1.12
% 2.01/1.12 clauses 15
% 2.01/1.12 conjectures 3
% 2.01/1.12 EPR 6
% 2.01/1.12 Horn 13
% 2.01/1.12 unary 6
% 2.01/1.12 binary 6
% 2.01/1.12 lits 27
% 2.01/1.12 lits eq 2
% 2.01/1.12 fd_pure 0
% 2.01/1.12 fd_pseudo 0
% 2.01/1.12 fd_cond 0
% 2.01/1.12 fd_pseudo_cond 0
% 2.01/1.12 AC symbols 0
% 2.01/1.12
% 2.01/1.12 ------ Schedule dynamic 5 is on
% 2.01/1.12
% 2.01/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.01/1.12
% 2.01/1.12
% 2.01/1.12 ------
% 2.01/1.12 Current options:
% 2.01/1.12 ------
% 2.01/1.12
% 2.01/1.12
% 2.01/1.12
% 2.01/1.12
% 2.01/1.12 ------ Proving...
% 2.01/1.12
% 2.01/1.12
% 2.01/1.12 % SZS status Theorem for theBenchmark.p
% 2.01/1.12
% 2.01/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.01/1.12
% 2.01/1.12
%------------------------------------------------------------------------------