TSTP Solution File: SET580+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET580+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 : Thu Aug 31 15:08:23 EDT 2023
% Result : Theorem 0.57s 1.18s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of formulae : 56 ( 8 unt; 0 def)
% Number of atoms : 178 ( 2 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 202 ( 80 ~; 92 |; 21 &)
% ( 6 <=>; 1 =>; 0 <=; 2 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 73 ( 4 sgn; 46 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f2,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(f3,axiom,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_difference_defn) ).
fof(f7,conjecture,
! [X0,X1,X2] :
( member(X0,symmetric_difference(X1,X2))
<=> ~ ( member(X0,X1)
<=> member(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th23) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2] :
( member(X0,symmetric_difference(X1,X2))
<=> ~ ( member(X0,X1)
<=> member(X0,X2) ) ),
inference(negated_conjecture,[],[f7]) ).
fof(f9,plain,
? [X0,X1,X2] :
( member(X0,symmetric_difference(X1,X2))
<~> ( member(X0,X1)
<~> member(X0,X2) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f10]) ).
fof(f12,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,[],[f2]) ).
fof(f13,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,[],[f12]) ).
fof(f18,plain,
? [X0,X1,X2] :
( ( ( ( member(X0,X1)
| ~ member(X0,X2) )
& ( member(X0,X2)
| ~ member(X0,X1) ) )
| ~ member(X0,symmetric_difference(X1,X2)) )
& ( ( ( ~ member(X0,X2)
| ~ member(X0,X1) )
& ( member(X0,X2)
| member(X0,X1) ) )
| member(X0,symmetric_difference(X1,X2)) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f19,plain,
( ? [X0,X1,X2] :
( ( ( ( member(X0,X1)
| ~ member(X0,X2) )
& ( member(X0,X2)
| ~ member(X0,X1) ) )
| ~ member(X0,symmetric_difference(X1,X2)) )
& ( ( ( ~ member(X0,X2)
| ~ member(X0,X1) )
& ( member(X0,X2)
| member(X0,X1) ) )
| member(X0,symmetric_difference(X1,X2)) ) )
=> ( ( ( ( member(sK1,sK2)
| ~ member(sK1,sK3) )
& ( member(sK1,sK3)
| ~ member(sK1,sK2) ) )
| ~ member(sK1,symmetric_difference(sK2,sK3)) )
& ( ( ( ~ member(sK1,sK3)
| ~ member(sK1,sK2) )
& ( member(sK1,sK3)
| member(sK1,sK2) ) )
| member(sK1,symmetric_difference(sK2,sK3)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
( ( ( ( member(sK1,sK2)
| ~ member(sK1,sK3) )
& ( member(sK1,sK3)
| ~ member(sK1,sK2) ) )
| ~ member(sK1,symmetric_difference(sK2,sK3)) )
& ( ( ( ~ member(sK1,sK3)
| ~ member(sK1,sK2) )
& ( member(sK1,sK3)
| member(sK1,sK2) ) )
| member(sK1,symmetric_difference(sK2,sK3)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f18,f19]) ).
fof(f21,plain,
! [X2,X0,X1] :
( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f22,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f24,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f27,plain,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
inference(cnf_transformation,[],[f3]) ).
fof(f34,plain,
( member(sK1,sK3)
| member(sK1,sK2)
| member(sK1,symmetric_difference(sK2,sK3)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f35,plain,
( ~ member(sK1,sK3)
| ~ member(sK1,sK2)
| member(sK1,symmetric_difference(sK2,sK3)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f36,plain,
( member(sK1,sK3)
| ~ member(sK1,sK2)
| ~ member(sK1,symmetric_difference(sK2,sK3)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f37,plain,
( member(sK1,sK2)
| ~ member(sK1,sK3)
| ~ member(sK1,symmetric_difference(sK2,sK3)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f39,plain,
( member(sK1,sK2)
| ~ member(sK1,sK3)
| ~ member(sK1,union(difference(sK2,sK3),difference(sK3,sK2))) ),
inference(definition_unfolding,[],[f37,f27]) ).
fof(f40,plain,
( member(sK1,sK3)
| ~ member(sK1,sK2)
| ~ member(sK1,union(difference(sK2,sK3),difference(sK3,sK2))) ),
inference(definition_unfolding,[],[f36,f27]) ).
fof(f41,plain,
( ~ member(sK1,sK3)
| ~ member(sK1,sK2)
| member(sK1,union(difference(sK2,sK3),difference(sK3,sK2))) ),
inference(definition_unfolding,[],[f35,f27]) ).
fof(f42,plain,
( member(sK1,sK3)
| member(sK1,sK2)
| member(sK1,union(difference(sK2,sK3),difference(sK3,sK2))) ),
inference(definition_unfolding,[],[f34,f27]) ).
cnf(c_49,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_50,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_51,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_52,plain,
( ~ member(X0,X1)
| member(X0,difference(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_53,plain,
( ~ member(X0,difference(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_54,plain,
( ~ member(X0,difference(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_59,negated_conjecture,
( ~ member(sK1,union(difference(sK2,sK3),difference(sK3,sK2)))
| ~ member(sK1,sK3)
| member(sK1,sK2) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_60,negated_conjecture,
( ~ member(sK1,union(difference(sK2,sK3),difference(sK3,sK2)))
| ~ member(sK1,sK2)
| member(sK1,sK3) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_61,negated_conjecture,
( ~ member(sK1,sK2)
| ~ member(sK1,sK3)
| member(sK1,union(difference(sK2,sK3),difference(sK3,sK2))) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_62,negated_conjecture,
( member(sK1,union(difference(sK2,sK3),difference(sK3,sK2)))
| member(sK1,sK2)
| member(sK1,sK3) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_570,plain,
( ~ member(sK1,difference(sK3,sK2))
| ~ member(sK1,sK3)
| member(sK1,sK2) ),
inference(superposition,[status(thm)],[c_49,c_59]) ).
cnf(c_595,plain,
( ~ member(sK1,difference(sK2,sK3))
| ~ member(sK1,sK2)
| member(sK1,sK3) ),
inference(superposition,[status(thm)],[c_50,c_60]) ).
cnf(c_607,plain,
( ~ member(sK1,difference(sK3,sK2))
| member(sK1,sK2) ),
inference(backward_subsumption_resolution,[status(thm)],[c_570,c_54]) ).
cnf(c_644,plain,
~ member(sK1,difference(sK3,sK2)),
inference(forward_subsumption_resolution,[status(thm)],[c_607,c_53]) ).
cnf(c_645,plain,
( ~ member(sK1,sK3)
| member(sK1,sK2) ),
inference(superposition,[status(thm)],[c_52,c_644]) ).
cnf(c_652,plain,
( member(sK1,union(difference(sK2,sK3),difference(sK3,sK2)))
| member(sK1,sK2) ),
inference(backward_subsumption_resolution,[status(thm)],[c_62,c_645]) ).
cnf(c_653,plain,
( ~ member(sK1,sK3)
| member(sK1,union(difference(sK2,sK3),difference(sK3,sK2))) ),
inference(backward_subsumption_resolution,[status(thm)],[c_61,c_645]) ).
cnf(c_662,plain,
( member(sK1,difference(sK2,sK3))
| member(sK1,difference(sK3,sK2))
| member(sK1,sK2) ),
inference(superposition,[status(thm)],[c_652,c_51]) ).
cnf(c_664,plain,
( member(sK1,difference(sK2,sK3))
| member(sK1,sK2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_662,c_644]) ).
cnf(c_669,plain,
member(sK1,sK2),
inference(forward_subsumption_resolution,[status(thm)],[c_664,c_54]) ).
cnf(c_670,plain,
( ~ member(sK1,union(difference(sK2,sK3),difference(sK3,sK2)))
| member(sK1,sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_60,c_669]) ).
cnf(c_673,plain,
( ~ member(sK1,difference(sK2,sK3))
| member(sK1,sK3) ),
inference(global_subsumption_just,[status(thm)],[c_595,c_62,c_595,c_670]) ).
cnf(c_677,plain,
~ member(sK1,difference(sK2,sK3)),
inference(forward_subsumption_resolution,[status(thm)],[c_673,c_53]) ).
cnf(c_678,plain,
( ~ member(sK1,sK2)
| member(sK1,sK3) ),
inference(superposition,[status(thm)],[c_52,c_677]) ).
cnf(c_679,plain,
member(sK1,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_678,c_669]) ).
cnf(c_680,plain,
member(sK1,union(difference(sK2,sK3),difference(sK3,sK2))),
inference(global_subsumption_just,[status(thm)],[c_653,c_653,c_679]) ).
cnf(c_682,plain,
( member(sK1,difference(sK2,sK3))
| member(sK1,difference(sK3,sK2)) ),
inference(superposition,[status(thm)],[c_680,c_51]) ).
cnf(c_683,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_682,c_644,c_677]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET580+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 10:13:39 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.57/1.18 % SZS status Started for theBenchmark.p
% 0.57/1.18 % SZS status Theorem for theBenchmark.p
% 0.57/1.18
% 0.57/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.57/1.18
% 0.57/1.18 ------ iProver source info
% 0.57/1.18
% 0.57/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.57/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.57/1.18 git: non_committed_changes: false
% 0.57/1.18 git: last_make_outside_of_git: false
% 0.57/1.18
% 0.57/1.18 ------ Parsing...
% 0.57/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.57/1.18
% 0.57/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.57/1.18
% 0.57/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.57/1.18
% 0.57/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.57/1.18 ------ Proving...
% 0.57/1.18 ------ Problem Properties
% 0.57/1.18
% 0.57/1.18
% 0.57/1.18 clauses 13
% 0.57/1.18 conjectures 4
% 0.57/1.18 EPR 0
% 0.57/1.18 Horn 9
% 0.57/1.18 unary 1
% 0.57/1.18 binary 4
% 0.57/1.18 lits 33
% 0.57/1.18 lits eq 3
% 0.57/1.18 fd_pure 0
% 0.57/1.18 fd_pseudo 0
% 0.57/1.18 fd_cond 0
% 0.57/1.18 fd_pseudo_cond 2
% 0.57/1.18 AC symbols 0
% 0.57/1.18
% 0.57/1.18 ------ Schedule dynamic 5 is on
% 0.57/1.18
% 0.57/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.57/1.18
% 0.57/1.18
% 0.57/1.18 ------
% 0.57/1.18 Current options:
% 0.57/1.18 ------
% 0.57/1.18
% 0.57/1.18
% 0.57/1.18
% 0.57/1.18
% 0.57/1.18 ------ Proving...
% 0.57/1.18
% 0.57/1.18
% 0.57/1.18 % SZS status Theorem for theBenchmark.p
% 0.57/1.18
% 0.57/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.57/1.18
% 0.57/1.18
%------------------------------------------------------------------------------