TSTP Solution File: SET025+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET025+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:05:40 EDT 2023
% Result : Theorem 0.81s 1.02s
% Output : CNFRefutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 16 unt; 0 def)
% Number of atoms : 18 ( 5 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 : 4 ( 2 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 : 22 ( 2 sgn; 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_defn) ).
fof(f44,conjecture,
! [X0,X1] : member(ordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_is_set) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] : member(ordered_pair(X0,X1),universal_class),
inference(negated_conjecture,[],[f44]) ).
fof(f84,plain,
? [X0,X1] : ~ member(ordered_pair(X0,X1),universal_class),
inference(ennf_transformation,[],[f45]) ).
fof(f133,plain,
( ? [X0,X1] : ~ member(ordered_pair(X0,X1),universal_class)
=> ~ member(ordered_pair(sK6,sK7),universal_class) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
~ member(ordered_pair(sK6,sK7),universal_class),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f84,f133]) ).
fof(f146,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f5]) ).
fof(f147,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f148,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[],[f7]) ).
fof(f222,plain,
~ member(ordered_pair(sK6,sK7),universal_class),
inference(cnf_transformation,[],[f134]) ).
fof(f223,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f148,f147,f147]) ).
fof(f260,plain,
~ member(unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,unordered_pair(sK7,sK7))),universal_class),
inference(definition_unfolding,[],[f222,f223]) ).
cnf(c_60,plain,
member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f146]) ).
cnf(c_128,negated_conjecture,
~ member(unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,unordered_pair(sK7,sK7))),universal_class),
inference(cnf_transformation,[],[f260]) ).
cnf(c_203,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_128,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET025+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sat Aug 26 16:24:29 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.39 Running first-order theorem proving
% 0.15/0.39 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.81/1.02 % SZS status Started for theBenchmark.p
% 0.81/1.02 % SZS status Theorem for theBenchmark.p
% 0.81/1.02
% 0.81/1.02 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.81/1.02
% 0.81/1.02 ------ iProver source info
% 0.81/1.02
% 0.81/1.02 git: date: 2023-05-31 18:12:56 +0000
% 0.81/1.02 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.81/1.02 git: non_committed_changes: false
% 0.81/1.02 git: last_make_outside_of_git: false
% 0.81/1.02
% 0.81/1.02 ------ Parsing...
% 0.81/1.02 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.81/1.02
% 0.81/1.02 ------ Preprocessing...
% 0.81/1.02
% 0.81/1.02 % SZS status Theorem for theBenchmark.p
% 0.81/1.02
% 0.81/1.02 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.81/1.02
% 0.81/1.02
%------------------------------------------------------------------------------