TSTP Solution File: SEU134+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU134+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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 17:03:56 EDT 2023
% Result : Theorem 0.76s 1.15s
% Output : CNFRefutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 3 unt; 0 def)
% Number of atoms : 60 ( 31 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 59 ( 24 ~; 25 |; 5 &)
% ( 3 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn; 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,conjecture,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
inference(negated_conjecture,[],[f13]) ).
fof(f15,axiom,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(f21,plain,
? [X0,X1] :
( empty_set = set_difference(X0,X1)
<~> subset(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f26,plain,
? [X0,X1] :
( ( ~ subset(X0,X1)
| empty_set != set_difference(X0,X1) )
& ( subset(X0,X1)
| empty_set = set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f27,plain,
( ? [X0,X1] :
( ( ~ subset(X0,X1)
| empty_set != set_difference(X0,X1) )
& ( subset(X0,X1)
| empty_set = set_difference(X0,X1) ) )
=> ( ( ~ subset(sK2,sK3)
| empty_set != set_difference(sK2,sK3) )
& ( subset(sK2,sK3)
| empty_set = set_difference(sK2,sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
( ( ~ subset(sK2,sK3)
| empty_set != set_difference(sK2,sK3) )
& ( subset(sK2,sK3)
| empty_set = set_difference(sK2,sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f26,f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| empty_set != set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f38,plain,
( subset(sK2,sK3)
| empty_set = set_difference(sK2,sK3) ),
inference(cnf_transformation,[],[f28]) ).
fof(f39,plain,
( ~ subset(sK2,sK3)
| empty_set != set_difference(sK2,sK3) ),
inference(cnf_transformation,[],[f28]) ).
fof(f40,plain,
! [X0,X1] :
( subset(X0,X1)
| empty_set != set_difference(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f41,plain,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_57,negated_conjecture,
( set_difference(sK2,sK3) != empty_set
| ~ subset(sK2,sK3) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_58,negated_conjecture,
( set_difference(sK2,sK3) = empty_set
| subset(sK2,sK3) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_59,plain,
( ~ subset(X0,X1)
| set_difference(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_60,plain,
( set_difference(X0,X1) != empty_set
| subset(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_66,plain,
( subset(sK2,sK3)
| set_difference(sK2,sK3) = empty_set ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
cnf(c_67,plain,
( set_difference(sK2,sK3) = empty_set
| subset(sK2,sK3) ),
inference(renaming,[status(thm)],[c_66]) ).
cnf(c_68,plain,
( subset(X0,X1)
| set_difference(X0,X1) != empty_set ),
inference(prop_impl_just,[status(thm)],[c_60]) ).
cnf(c_69,plain,
( set_difference(X0,X1) != empty_set
| subset(X0,X1) ),
inference(renaming,[status(thm)],[c_68]) ).
cnf(c_70,plain,
( ~ subset(X0,X1)
| set_difference(X0,X1) = empty_set ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
cnf(c_116,plain,
subset(sK2,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_67,c_69]) ).
cnf(c_166,plain,
( X0 != sK2
| X1 != sK3
| set_difference(X0,X1) = empty_set ),
inference(resolution_lifted,[status(thm)],[c_116,c_70]) ).
cnf(c_167,plain,
set_difference(sK2,sK3) = empty_set,
inference(unflattening,[status(thm)],[c_166]) ).
cnf(c_168,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_167,c_116,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU134+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n025.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 Aug 24 01:25:21 EDT 2023
% 0.13/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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.76/1.15 % SZS status Started for theBenchmark.p
% 0.76/1.15 % SZS status Theorem for theBenchmark.p
% 0.76/1.15
% 0.76/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.76/1.15
% 0.76/1.15 ------ iProver source info
% 0.76/1.15
% 0.76/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.76/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.76/1.15 git: non_committed_changes: false
% 0.76/1.15 git: last_make_outside_of_git: false
% 0.76/1.15
% 0.76/1.15 ------ Parsing...
% 0.76/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.76/1.15
% 0.76/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s
% 0.76/1.15
% 0.76/1.15 % SZS status Theorem for theBenchmark.p
% 0.76/1.15
% 0.76/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.76/1.15
% 0.76/1.15
%------------------------------------------------------------------------------