TSTP Solution File: SET891+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET891+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:10:32 EDT 2023
% Result : Theorem 0.93s 1.19s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 14 unt; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn; 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] : set_union2(X0,X1) = union(unordered_pair(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l52_zfmisc_1) ).
fof(f9,conjecture,
! [X0,X1] : unordered_pair(X0,X1) = union(unordered_pair(singleton(X0),singleton(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] : unordered_pair(X0,X1) = union(unordered_pair(singleton(X0),singleton(X1))),
inference(negated_conjecture,[],[f9]) ).
fof(f11,axiom,
! [X0,X1] : unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t41_enumset1) ).
fof(f15,plain,
? [X0,X1] : unordered_pair(X0,X1) != union(unordered_pair(singleton(X0),singleton(X1))),
inference(ennf_transformation,[],[f10]) ).
fof(f20,plain,
( ? [X0,X1] : unordered_pair(X0,X1) != union(unordered_pair(singleton(X0),singleton(X1)))
=> unordered_pair(sK2,sK3) != union(unordered_pair(singleton(sK2),singleton(sK3))) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
unordered_pair(sK2,sK3) != union(unordered_pair(singleton(sK2),singleton(sK3))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f15,f20]) ).
fof(f27,plain,
! [X0,X1] : set_union2(X0,X1) = union(unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f6]) ).
fof(f30,plain,
unordered_pair(sK2,sK3) != union(unordered_pair(singleton(sK2),singleton(sK3))),
inference(cnf_transformation,[],[f21]) ).
fof(f31,plain,
! [X0,X1] : unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)),
inference(cnf_transformation,[],[f11]) ).
fof(f32,plain,
! [X0,X1] : set_union2(X0,X1) = union(set_union2(singleton(X0),singleton(X1))),
inference(definition_unfolding,[],[f27,f31]) ).
fof(f34,plain,
set_union2(singleton(sK2),singleton(sK3)) != union(set_union2(singleton(singleton(sK2)),singleton(singleton(sK3)))),
inference(definition_unfolding,[],[f30,f31,f31]) ).
cnf(c_49,plain,
union(set_union2(singleton(X0),singleton(X1))) = set_union2(X0,X1),
inference(cnf_transformation,[],[f32]) ).
cnf(c_57,negated_conjecture,
union(set_union2(singleton(singleton(sK2)),singleton(singleton(sK3)))) != set_union2(singleton(sK2),singleton(sK3)),
inference(cnf_transformation,[],[f34]) ).
cnf(c_73,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_57,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET891+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n014.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 12:51:17 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.93/1.19 % SZS status Started for theBenchmark.p
% 0.93/1.19 % SZS status Theorem for theBenchmark.p
% 0.93/1.19
% 0.93/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.93/1.19
% 0.93/1.19 ------ iProver source info
% 0.93/1.19
% 0.93/1.19 git: date: 2023-05-31 18:12:56 +0000
% 0.93/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.93/1.19 git: non_committed_changes: false
% 0.93/1.19 git: last_make_outside_of_git: false
% 0.93/1.19
% 0.93/1.19 ------ Parsing...
% 0.93/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.93/1.19
% 0.93/1.19 ------ Preprocessing...
% 0.93/1.19
% 0.93/1.19 % SZS status Theorem for theBenchmark.p
% 0.93/1.19
% 0.93/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.93/1.19
% 0.93/1.19
%------------------------------------------------------------------------------