TSTP Solution File: SET633+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET633+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:49 EDT 2023
% Result : Theorem 1.77s 1.11s
% Output : CNFRefutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 48 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 45 ( 19 ~; 9 |; 13 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 34 ( 0 sgn; 22 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,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(f2,axiom,
! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(union(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_subset) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( ( subset(difference(X1,X0),X2)
& subset(difference(X0,X1),X2) )
=> subset(symmetric_difference(X0,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th115) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(difference(X1,X0),X2)
& subset(difference(X0,X1),X2) )
=> subset(symmetric_difference(X0,X1),X2) ),
inference(negated_conjecture,[],[f9]) ).
fof(f11,plain,
! [X0,X1,X2] :
( subset(union(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f12,plain,
! [X0,X1,X2] :
( subset(union(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(flattening,[],[f11]) ).
fof(f14,plain,
? [X0,X1,X2] :
( ~ subset(symmetric_difference(X0,X1),X2)
& subset(difference(X1,X0),X2)
& subset(difference(X0,X1),X2) ),
inference(ennf_transformation,[],[f10]) ).
fof(f15,plain,
? [X0,X1,X2] :
( ~ subset(symmetric_difference(X0,X1),X2)
& subset(difference(X1,X0),X2)
& subset(difference(X0,X1),X2) ),
inference(flattening,[],[f14]) ).
fof(f26,plain,
( ? [X0,X1,X2] :
( ~ subset(symmetric_difference(X0,X1),X2)
& subset(difference(X1,X0),X2)
& subset(difference(X0,X1),X2) )
=> ( ~ subset(symmetric_difference(sK2,sK3),sK4)
& subset(difference(sK3,sK2),sK4)
& subset(difference(sK2,sK3),sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
( ~ subset(symmetric_difference(sK2,sK3),sK4)
& subset(difference(sK3,sK2),sK4)
& subset(difference(sK2,sK3),sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f15,f26]) ).
fof(f28,plain,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
inference(cnf_transformation,[],[f1]) ).
fof(f29,plain,
! [X2,X0,X1] :
( subset(union(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f43,plain,
subset(difference(sK2,sK3),sK4),
inference(cnf_transformation,[],[f27]) ).
fof(f44,plain,
subset(difference(sK3,sK2),sK4),
inference(cnf_transformation,[],[f27]) ).
fof(f45,plain,
~ subset(symmetric_difference(sK2,sK3),sK4),
inference(cnf_transformation,[],[f27]) ).
fof(f47,plain,
~ subset(union(difference(sK2,sK3),difference(sK3,sK2)),sK4),
inference(definition_unfolding,[],[f45,f28]) ).
cnf(c_49,plain,
( ~ subset(X0,X1)
| ~ subset(X2,X1)
| subset(union(X0,X2),X1) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_61,negated_conjecture,
~ subset(union(difference(sK2,sK3),difference(sK3,sK2)),sK4),
inference(cnf_transformation,[],[f47]) ).
cnf(c_62,negated_conjecture,
subset(difference(sK3,sK2),sK4),
inference(cnf_transformation,[],[f44]) ).
cnf(c_63,negated_conjecture,
subset(difference(sK2,sK3),sK4),
inference(cnf_transformation,[],[f43]) ).
cnf(c_505,plain,
( ~ subset(difference(sK2,sK3),sK4)
| ~ subset(difference(sK3,sK2),sK4) ),
inference(superposition,[status(thm)],[c_49,c_61]) ).
cnf(c_506,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_505,c_62,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET633+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n013.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 : Sat Aug 26 09:19:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.77/1.11 % SZS status Started for theBenchmark.p
% 1.77/1.11 % SZS status Theorem for theBenchmark.p
% 1.77/1.11
% 1.77/1.11 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.77/1.11
% 1.77/1.11 ------ iProver source info
% 1.77/1.11
% 1.77/1.11 git: date: 2023-05-31 18:12:56 +0000
% 1.77/1.11 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.77/1.11 git: non_committed_changes: false
% 1.77/1.11 git: last_make_outside_of_git: false
% 1.77/1.11
% 1.77/1.11 ------ Parsing...
% 1.77/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.77/1.11
% 1.77/1.11 ------ 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
% 1.77/1.11
% 1.77/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.77/1.11
% 1.77/1.11 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.77/1.11 ------ Proving...
% 1.77/1.11 ------ Problem Properties
% 1.77/1.11
% 1.77/1.11
% 1.77/1.11 clauses 14
% 1.77/1.11 conjectures 3
% 1.77/1.11 EPR 2
% 1.77/1.11 Horn 11
% 1.77/1.11 unary 5
% 1.77/1.11 binary 4
% 1.77/1.11 lits 28
% 1.77/1.11 lits eq 3
% 1.77/1.11 fd_pure 0
% 1.77/1.11 fd_pseudo 0
% 1.77/1.11 fd_cond 0
% 1.77/1.11 fd_pseudo_cond 2
% 1.77/1.11 AC symbols 0
% 1.77/1.11
% 1.77/1.11 ------ Schedule dynamic 5 is on
% 1.77/1.11
% 1.77/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.77/1.11
% 1.77/1.11
% 1.77/1.11 ------
% 1.77/1.11 Current options:
% 1.77/1.11 ------
% 1.77/1.11
% 1.77/1.11
% 1.77/1.11
% 1.77/1.11
% 1.77/1.11 ------ Proving...
% 1.77/1.11
% 1.77/1.11
% 1.77/1.11 % SZS status Theorem for theBenchmark.p
% 1.77/1.11
% 1.77/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.77/1.11
% 1.77/1.11
%------------------------------------------------------------------------------