TSTP Solution File: SET009+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET009+3 : TPTP v8.1.2. Released v2.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 02:59:14 EDT 2024
% Result : Theorem 2.81s 1.23s
% Output : CNFRefutation 2.81s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,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(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f4,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(difference(X2,X1),difference(X2,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_difference) ).
fof(f5,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> subset(difference(X2,X1),difference(X2,X0)) ),
inference(negated_conjecture,[],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
? [X0,X1,X2] :
( ~ subset(difference(X2,X1),difference(X2,X0))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f8,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,[],[f1]) ).
fof(f9,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,[],[f8]) ).
fof(f10,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,[],[f6]) ).
fof(f11,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,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f13,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])],[f11,f12]) ).
fof(f14,plain,
( ? [X0,X1,X2] :
( ~ subset(difference(X2,X1),difference(X2,X0))
& subset(X0,X1) )
=> ( ~ subset(difference(sK3,sK2),difference(sK3,sK1))
& subset(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ~ subset(difference(sK3,sK2),difference(sK3,sK1))
& subset(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f7,f14]) ).
fof(f16,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f19,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
~ subset(difference(sK3,sK2),difference(sK3,sK1)),
inference(cnf_transformation,[],[f15]) ).
cnf(c_49,plain,
( ~ member(X0,X1)
| member(X0,difference(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_50,plain,
( ~ member(X0,difference(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_51,plain,
( ~ member(X0,difference(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_52,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_53,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_54,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_56,negated_conjecture,
~ subset(difference(sK3,sK2),difference(sK3,sK1)),
inference(cnf_transformation,[],[f24]) ).
cnf(c_57,negated_conjecture,
subset(sK1,sK2),
inference(cnf_transformation,[],[f23]) ).
cnf(c_142,plain,
difference(sK3,sK2) = sP0_iProver_def,
definition ).
cnf(c_143,plain,
difference(sK3,sK1) = sP1_iProver_def,
definition ).
cnf(c_144,negated_conjecture,
subset(sK1,sK2),
inference(demodulation,[status(thm)],[c_57]) ).
cnf(c_145,negated_conjecture,
~ subset(sP0_iProver_def,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_56,c_143,c_142]) ).
cnf(c_300,plain,
( ~ member(X0,sP0_iProver_def)
| member(X0,sK3) ),
inference(superposition,[status(thm)],[c_142,c_51]) ).
cnf(c_315,plain,
( member(sK0(sP0_iProver_def,X0),sK3)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_53,c_300]) ).
cnf(c_340,plain,
( ~ member(sK0(X0,difference(X1,X2)),X1)
| member(sK0(X0,difference(X1,X2)),X2)
| subset(X0,difference(X1,X2)) ),
inference(superposition,[status(thm)],[c_49,c_52]) ).
cnf(c_350,plain,
( ~ member(sK0(difference(X0,X1),X2),X1)
| subset(difference(X0,X1),X2) ),
inference(superposition,[status(thm)],[c_53,c_50]) ).
cnf(c_557,plain,
( member(sK0(sP0_iProver_def,difference(sK3,X0)),X0)
| subset(sP0_iProver_def,difference(sK3,X0)) ),
inference(superposition,[status(thm)],[c_315,c_340]) ).
cnf(c_1129,plain,
( ~ member(sK0(sP0_iProver_def,X0),sK2)
| subset(difference(sK3,sK2),X0) ),
inference(superposition,[status(thm)],[c_142,c_350]) ).
cnf(c_1134,plain,
( ~ member(sK0(sP0_iProver_def,X0),sK2)
| subset(sP0_iProver_def,X0) ),
inference(light_normalisation,[status(thm)],[c_1129,c_142]) ).
cnf(c_1507,plain,
( member(sK0(sP0_iProver_def,sP1_iProver_def),sK1)
| subset(sP0_iProver_def,difference(sK3,sK1)) ),
inference(superposition,[status(thm)],[c_143,c_557]) ).
cnf(c_1520,plain,
( member(sK0(sP0_iProver_def,sP1_iProver_def),sK1)
| subset(sP0_iProver_def,sP1_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_1507,c_143]) ).
cnf(c_1521,plain,
member(sK0(sP0_iProver_def,sP1_iProver_def),sK1),
inference(forward_subsumption_resolution,[status(thm)],[c_1520,c_145]) ).
cnf(c_1586,plain,
( ~ subset(sK1,X0)
| member(sK0(sP0_iProver_def,sP1_iProver_def),X0) ),
inference(superposition,[status(thm)],[c_1521,c_54]) ).
cnf(c_1631,plain,
( ~ subset(sK1,sK2)
| subset(sP0_iProver_def,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_1586,c_1134]) ).
cnf(c_1632,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1631,c_145,c_144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET009+3 : TPTP v8.1.2. Released v2.2.0.
% 0.13/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n004.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 20:34:18 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
% 2.81/1.23 % SZS status Started for theBenchmark.p
% 2.81/1.23 % SZS status Theorem for theBenchmark.p
% 2.81/1.23
% 2.81/1.23 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.81/1.23
% 2.81/1.23 ------ iProver source info
% 2.81/1.23
% 2.81/1.23 git: date: 2024-05-02 19:28:25 +0000
% 2.81/1.23 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.81/1.23 git: non_committed_changes: false
% 2.81/1.23
% 2.81/1.23 ------ Parsing...
% 2.81/1.23 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.81/1.23
% 2.81/1.23 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.81/1.23
% 2.81/1.23 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.81/1.23
% 2.81/1.23 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.81/1.23 ------ Proving...
% 2.81/1.23 ------ Problem Properties
% 2.81/1.23
% 2.81/1.23
% 2.81/1.23 clauses 11
% 2.81/1.23 conjectures 2
% 2.81/1.23 EPR 4
% 2.81/1.23 Horn 9
% 2.81/1.23 unary 5
% 2.81/1.23 binary 4
% 2.81/1.23 lits 19
% 2.81/1.23 lits eq 2
% 2.81/1.23 fd_pure 0
% 2.81/1.23 fd_pseudo 0
% 2.81/1.23 fd_cond 0
% 2.81/1.23 fd_pseudo_cond 0
% 2.81/1.23 AC symbols 0
% 2.81/1.23
% 2.81/1.23 ------ Schedule dynamic 5 is on
% 2.81/1.23
% 2.81/1.23 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.81/1.23
% 2.81/1.23
% 2.81/1.23 ------
% 2.81/1.23 Current options:
% 2.81/1.23 ------
% 2.81/1.23
% 2.81/1.23
% 2.81/1.23
% 2.81/1.23
% 2.81/1.23 ------ Proving...
% 2.81/1.23
% 2.81/1.23
% 2.81/1.23 % SZS status Theorem for theBenchmark.p
% 2.81/1.23
% 2.81/1.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.81/1.23
% 2.81/1.24
%------------------------------------------------------------------------------