TSTP Solution File: SEU150+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU150+1 : TPTP v8.1.2. Released v3.3.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 17:04:07 EDT 2023
% Result : Theorem 1.63s 1.16s
% Output : CNFRefutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 44 ( 43 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 33 ( 16 ~; 9 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 2 sgn; 19 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f4,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f5,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
inference(negated_conjecture,[],[f5]) ).
fof(f7,plain,
! [X0,X1,X2] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f4]) ).
fof(f8,plain,
? [X0,X1,X2] :
( X1 != X2
& singleton(X0) = unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
( ? [X0,X1,X2] :
( X1 != X2
& singleton(X0) = unordered_pair(X1,X2) )
=> ( sK1 != sK2
& singleton(sK0) = unordered_pair(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( sK1 != sK2
& singleton(sK0) = unordered_pair(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f9]) ).
fof(f11,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f12,plain,
! [X2,X0,X1] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
singleton(sK0) = unordered_pair(sK1,sK2),
inference(cnf_transformation,[],[f10]) ).
fof(f14,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f10]) ).
cnf(c_49,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f11]) ).
cnf(c_50,plain,
( unordered_pair(X0,X1) != singleton(X2)
| X0 = X2 ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_51,negated_conjecture,
sK1 != sK2,
inference(cnf_transformation,[],[f14]) ).
cnf(c_52,negated_conjecture,
unordered_pair(sK1,sK2) = singleton(sK0),
inference(cnf_transformation,[],[f13]) ).
cnf(c_71,plain,
X0 = X0,
theory(equality) ).
cnf(c_74,plain,
( X0 != X1
| singleton(X0) = singleton(X1) ),
theory(equality) ).
cnf(c_75,plain,
( sK1 != sK1
| singleton(sK1) = singleton(sK1) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_76,plain,
sK1 = sK1,
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_107,plain,
( unordered_pair(X0,X1) != singleton(X2)
| X1 = X2 ),
inference(superposition,[status(thm)],[c_49,c_50]) ).
cnf(c_109,plain,
( singleton(X0) != singleton(sK0)
| X0 = sK1 ),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_118,plain,
sK1 = sK0,
inference(equality_resolution,[status(thm)],[c_109]) ).
cnf(c_120,plain,
unordered_pair(sK1,sK2) = singleton(sK1),
inference(demodulation,[status(thm)],[c_52,c_118]) ).
cnf(c_135,plain,
( singleton(X0) != singleton(sK1)
| X0 = sK2 ),
inference(superposition,[status(thm)],[c_120,c_107]) ).
cnf(c_138,plain,
( singleton(sK1) != singleton(sK1)
| sK1 = sK2 ),
inference(instantiation,[status(thm)],[c_135]) ).
cnf(c_139,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_138,c_76,c_75,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU150+1 : TPTP v8.1.2. Released v3.3.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 : Wed Aug 23 16:15:47 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.63/1.16 % SZS status Started for theBenchmark.p
% 1.63/1.16 % SZS status Theorem for theBenchmark.p
% 1.63/1.16
% 1.63/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.63/1.16
% 1.63/1.16 ------ iProver source info
% 1.63/1.16
% 1.63/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.63/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.63/1.16 git: non_committed_changes: false
% 1.63/1.16 git: last_make_outside_of_git: false
% 1.63/1.16
% 1.63/1.16 ------ Parsing...
% 1.63/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.63/1.16
% 1.63/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 1.63/1.16
% 1.63/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.63/1.16
% 1.63/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.63/1.16 ------ Proving...
% 1.63/1.16 ------ Problem Properties
% 1.63/1.16
% 1.63/1.16
% 1.63/1.16 clauses 4
% 1.63/1.16 conjectures 2
% 1.63/1.16 EPR 1
% 1.63/1.16 Horn 4
% 1.63/1.16 unary 3
% 1.63/1.16 binary 1
% 1.63/1.16 lits 5
% 1.63/1.16 lits eq 5
% 1.63/1.16 fd_pure 0
% 1.63/1.16 fd_pseudo 0
% 1.63/1.16 fd_cond 0
% 1.63/1.16 fd_pseudo_cond 1
% 1.63/1.16 AC symbols 0
% 1.63/1.16
% 1.63/1.16 ------ Schedule dynamic 5 is on
% 1.63/1.16
% 1.63/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.63/1.16
% 1.63/1.16
% 1.63/1.16 ------
% 1.63/1.16 Current options:
% 1.63/1.16 ------
% 1.63/1.16
% 1.63/1.16
% 1.63/1.16
% 1.63/1.16
% 1.63/1.16 ------ Proving...
% 1.63/1.16
% 1.63/1.16
% 1.63/1.16 % SZS status Theorem for theBenchmark.p
% 1.63/1.16
% 1.63/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.63/1.16
% 1.63/1.16
%------------------------------------------------------------------------------