TSTP Solution File: SEU156+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU156+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:11 EDT 2023
% Result : Theorem 3.14s 1.14s
% Output : CNFRefutation 3.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 21 unt; 0 def)
% Number of atoms : 129 ( 128 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 109 ( 44 ~; 52 |; 8 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 97 ( 5 sgn; 56 !; 8 ?)
% 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(f2,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f7,axiom,
! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f8,conjecture,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
inference(negated_conjecture,[],[f8]) ).
fof(f10,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f12,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f13,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f15,plain,
! [X0,X1,X2,X3] :
( X0 = X3
| X0 = X2
| unordered_pair(X0,X1) != unordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f16,plain,
? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f18,plain,
! [X0,X1,X2] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f12]) ).
fof(f19,plain,
! [X0,X1,X2] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f24,plain,
( ? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) )
=> ( ( sK3 != sK5
| sK2 != sK4 )
& ordered_pair(sK2,sK3) = ordered_pair(sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
( ( sK3 != sK5
| sK2 != sK4 )
& ordered_pair(sK2,sK3) = ordered_pair(sK4,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f16,f24]) ).
fof(f26,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f27,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f2]) ).
fof(f32,plain,
! [X2,X3,X0,X1] :
( X0 = X3
| X0 = X2
| unordered_pair(X0,X1) != unordered_pair(X2,X3) ),
inference(cnf_transformation,[],[f15]) ).
fof(f33,plain,
ordered_pair(sK2,sK3) = ordered_pair(sK4,sK5),
inference(cnf_transformation,[],[f25]) ).
fof(f34,plain,
( sK3 != sK5
| sK2 != sK4 ),
inference(cnf_transformation,[],[f25]) ).
fof(f35,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f37,plain,
! [X2,X0,X1] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f38,plain,
! [X2,X0,X1] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f39,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f27,f35]) ).
fof(f41,plain,
unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2)) = unordered_pair(unordered_pair(sK4,sK5),unordered_pair(sK4,sK4)),
inference(definition_unfolding,[],[f33,f39,f39]) ).
fof(f43,plain,
! [X2,X0,X1] :
( X0 = X1
| unordered_pair(X0,X0) != unordered_pair(X1,X2) ),
inference(definition_unfolding,[],[f37,f35]) ).
fof(f44,plain,
! [X2,X0,X1] :
( X1 = X2
| unordered_pair(X0,X0) != unordered_pair(X1,X2) ),
inference(definition_unfolding,[],[f38,f35]) ).
cnf(c_49,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,plain,
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_55,negated_conjecture,
( sK3 != sK5
| sK2 != sK4 ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_56,negated_conjecture,
unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2)) = unordered_pair(unordered_pair(sK4,sK5),unordered_pair(sK4,sK4)),
inference(cnf_transformation,[],[f41]) ).
cnf(c_58,plain,
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_59,plain,
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_61,plain,
unordered_pair(sK2,sK2) = unordered_pair(sK2,sK2),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_113,plain,
unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3)) = unordered_pair(unordered_pair(sK4,sK4),unordered_pair(sK4,sK5)),
inference(demodulation,[status(thm)],[c_56,c_49]) ).
cnf(c_375,plain,
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X1 = X2
| X1 = X3 ),
inference(superposition,[status(thm)],[c_49,c_54]) ).
cnf(c_377,plain,
( unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3)) != unordered_pair(X0,X1)
| unordered_pair(sK4,sK4) = X0
| unordered_pair(sK4,sK4) = X1 ),
inference(superposition,[status(thm)],[c_113,c_54]) ).
cnf(c_423,plain,
( unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3)) != unordered_pair(X0,X1)
| unordered_pair(sK4,sK5) = X0
| unordered_pair(sK4,sK5) = X1 ),
inference(superposition,[status(thm)],[c_113,c_375]) ).
cnf(c_426,plain,
( unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3)) != unordered_pair(X0,X1)
| unordered_pair(sK4,sK5) = X1
| unordered_pair(sK4,sK4) = X1 ),
inference(superposition,[status(thm)],[c_113,c_375]) ).
cnf(c_458,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK4,sK4)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4) ),
inference(equality_resolution,[status(thm)],[c_377]) ).
cnf(c_482,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5) ),
inference(equality_resolution,[status(thm)],[c_423]) ).
cnf(c_495,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5)
| unordered_pair(sK2,sK3) = unordered_pair(sK4,sK4) ),
inference(equality_resolution,[status(thm)],[c_426]) ).
cnf(c_512,plain,
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| X0 = X1 ),
inference(superposition,[status(thm)],[c_458,c_59]) ).
cnf(c_518,plain,
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| X0 = sK4 ),
inference(superposition,[status(thm)],[c_458,c_54]) ).
cnf(c_582,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| sK3 = sK2 ),
inference(equality_resolution,[status(thm)],[c_512]) ).
cnf(c_598,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| sK2 = sK4 ),
inference(equality_resolution,[status(thm)],[c_518]) ).
cnf(c_621,plain,
( unordered_pair(X0,X1) != unordered_pair(sK2,sK2)
| X0 = X1
| sK3 = sK2 ),
inference(superposition,[status(thm)],[c_582,c_59]) ).
cnf(c_686,plain,
sK2 = sK4,
inference(forward_subsumption_resolution,[status(thm)],[c_598,c_58]) ).
cnf(c_701,plain,
( sK3 != sK5
| sK2 != sK2 ),
inference(demodulation,[status(thm)],[c_55,c_686]) ).
cnf(c_702,plain,
sK3 != sK5,
inference(equality_resolution_simp,[status(thm)],[c_701]) ).
cnf(c_742,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK2,sK5)
| unordered_pair(sK2,sK5) = unordered_pair(sK2,sK2) ),
inference(light_normalisation,[status(thm)],[c_482,c_686]) ).
cnf(c_747,plain,
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| unordered_pair(sK2,sK5) = unordered_pair(sK2,sK2)
| X0 = sK5
| X1 = sK5 ),
inference(superposition,[status(thm)],[c_742,c_375]) ).
cnf(c_789,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK2,sK5)
| unordered_pair(sK2,sK3) = unordered_pair(sK2,sK2) ),
inference(light_normalisation,[status(thm)],[c_495,c_686]) ).
cnf(c_1039,plain,
( unordered_pair(sK2,sK5) = unordered_pair(sK2,sK2)
| sK3 = sK5
| sK5 = sK2 ),
inference(equality_resolution,[status(thm)],[c_747]) ).
cnf(c_1040,plain,
( unordered_pair(sK2,sK5) = unordered_pair(sK2,sK2)
| sK5 = sK2 ),
inference(forward_subsumption_resolution,[status(thm)],[c_1039,c_702]) ).
cnf(c_1132,plain,
( sK3 = sK2
| sK5 = sK2 ),
inference(superposition,[status(thm)],[c_1040,c_621]) ).
cnf(c_1142,plain,
( unordered_pair(X0,X0) != unordered_pair(sK2,sK2)
| sK5 = sK2 ),
inference(superposition,[status(thm)],[c_1040,c_59]) ).
cnf(c_1182,plain,
( unordered_pair(sK2,sK2) != unordered_pair(sK2,sK2)
| sK5 = sK2 ),
inference(instantiation,[status(thm)],[c_1142]) ).
cnf(c_1195,plain,
sK5 = sK2,
inference(global_subsumption_just,[status(thm)],[c_1132,c_61,c_1182]) ).
cnf(c_1212,plain,
unordered_pair(sK2,sK3) = unordered_pair(sK2,sK2),
inference(demodulation,[status(thm)],[c_789,c_1195]) ).
cnf(c_1215,plain,
sK3 != sK2,
inference(demodulation,[status(thm)],[c_702,c_1195]) ).
cnf(c_1242,plain,
( unordered_pair(X0,X0) != unordered_pair(sK2,sK2)
| sK3 = sK2 ),
inference(superposition,[status(thm)],[c_1212,c_59]) ).
cnf(c_1246,plain,
unordered_pair(X0,X0) != unordered_pair(sK2,sK2),
inference(forward_subsumption_resolution,[status(thm)],[c_1242,c_1215]) ).
cnf(c_1256,plain,
unordered_pair(sK2,sK2) != unordered_pair(sK2,sK2),
inference(instantiation,[status(thm)],[c_1246]) ).
cnf(c_1257,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1256,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU156+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n029.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 14:05:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.14/1.14 % SZS status Started for theBenchmark.p
% 3.14/1.14 % SZS status Theorem for theBenchmark.p
% 3.14/1.14
% 3.14/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.14/1.14
% 3.14/1.14 ------ iProver source info
% 3.14/1.14
% 3.14/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.14/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.14/1.14 git: non_committed_changes: false
% 3.14/1.14 git: last_make_outside_of_git: false
% 3.14/1.14
% 3.14/1.14 ------ Parsing...
% 3.14/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.14/1.14
% 3.14/1.14 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.14/1.14
% 3.14/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.14/1.14
% 3.14/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.14/1.14 ------ Proving...
% 3.14/1.14 ------ Problem Properties
% 3.14/1.14
% 3.14/1.14
% 3.14/1.14 clauses 10
% 3.14/1.14 conjectures 1
% 3.14/1.14 EPR 3
% 3.14/1.14 Horn 9
% 3.14/1.14 unary 5
% 3.14/1.14 binary 4
% 3.14/1.14 lits 16
% 3.14/1.14 lits eq 13
% 3.14/1.14 fd_pure 0
% 3.14/1.14 fd_pseudo 0
% 3.14/1.14 fd_cond 0
% 3.14/1.14 fd_pseudo_cond 4
% 3.14/1.14 AC symbols 0
% 3.14/1.14
% 3.14/1.14 ------ Schedule dynamic 5 is on
% 3.14/1.14
% 3.14/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.14/1.14
% 3.14/1.14
% 3.14/1.14 ------
% 3.14/1.14 Current options:
% 3.14/1.14 ------
% 3.14/1.14
% 3.14/1.14
% 3.14/1.14
% 3.14/1.14
% 3.14/1.14 ------ Proving...
% 3.14/1.14
% 3.14/1.14
% 3.14/1.14 % SZS status Theorem for theBenchmark.p
% 3.14/1.14
% 3.14/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.14/1.14
% 3.14/1.14
%------------------------------------------------------------------------------