TSTP Solution File: SEU156+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU156+1 : TPTP v8.1.2. Released v3.3.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 : Fri May 3 03:04:44 EDT 2024
% Result : Theorem 0.37s 1.05s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 8
% Syntax : Number of formulae : 65 ( 21 unt; 0 def)
% Number of atoms : 131 ( 130 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 112 ( 46 ~; 53 |; 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(f10,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(f11,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(f12,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
inference(negated_conjecture,[],[f11]) ).
fof(f13,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f15,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f16,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f18,plain,
! [X0,X1,X2,X3] :
( X0 = X3
| X0 = X2
| unordered_pair(X0,X1) != unordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f10]) ).
fof(f19,plain,
? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f12]) ).
fof(f21,plain,
! [X0,X1,X2] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0,X1,X2] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f27,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(f28,plain,
( ( sK3 != sK5
| sK2 != sK4 )
& ordered_pair(sK2,sK3) = ordered_pair(sK4,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f19,f27]) ).
fof(f29,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f30,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f2]) ).
fof(f35,plain,
! [X2,X3,X0,X1] :
( X0 = X3
| X0 = X2
| unordered_pair(X0,X1) != unordered_pair(X2,X3) ),
inference(cnf_transformation,[],[f18]) ).
fof(f36,plain,
ordered_pair(sK2,sK3) = ordered_pair(sK4,sK5),
inference(cnf_transformation,[],[f28]) ).
fof(f37,plain,
( sK3 != sK5
| sK2 != sK4 ),
inference(cnf_transformation,[],[f28]) ).
fof(f38,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f13]) ).
fof(f40,plain,
! [X2,X0,X1] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f41,plain,
! [X2,X0,X1] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f42,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f30,f38]) ).
fof(f44,plain,
unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2)) = unordered_pair(unordered_pair(sK4,sK5),unordered_pair(sK4,sK4)),
inference(definition_unfolding,[],[f36,f42,f42]) ).
fof(f46,plain,
! [X2,X0,X1] :
( X0 = X1
| unordered_pair(X0,X0) != unordered_pair(X1,X2) ),
inference(definition_unfolding,[],[f40,f38]) ).
fof(f47,plain,
! [X2,X0,X1] :
( X1 = X2
| unordered_pair(X0,X0) != unordered_pair(X1,X2) ),
inference(definition_unfolding,[],[f41,f38]) ).
cnf(c_49,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f29]) ).
cnf(c_54,plain,
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_55,negated_conjecture,
( sK3 != sK5
| sK2 != sK4 ),
inference(cnf_transformation,[],[f37]) ).
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,[],[f44]) ).
cnf(c_58,plain,
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_59,plain,
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f47]) ).
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_214,negated_conjecture,
( sK3 != sK5
| sK2 != sK4 ),
inference(demodulation,[status(thm)],[c_55]) ).
cnf(c_376,plain,
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X1 = X2
| X1 = X3 ),
inference(superposition,[status(thm)],[c_49,c_54]) ).
cnf(c_378,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_424,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_376]) ).
cnf(c_427,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_376]) ).
cnf(c_459,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK4,sK4)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4) ),
inference(equality_resolution,[status(thm)],[c_378]) ).
cnf(c_483,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5) ),
inference(equality_resolution,[status(thm)],[c_424]) ).
cnf(c_496,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5)
| unordered_pair(sK2,sK3) = unordered_pair(sK4,sK4) ),
inference(equality_resolution,[status(thm)],[c_427]) ).
cnf(c_513,plain,
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| X0 = X1 ),
inference(superposition,[status(thm)],[c_459,c_59]) ).
cnf(c_519,plain,
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| X0 = sK4 ),
inference(superposition,[status(thm)],[c_459,c_54]) ).
cnf(c_583,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| sK3 = sK2 ),
inference(equality_resolution,[status(thm)],[c_513]) ).
cnf(c_599,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| sK2 = sK4 ),
inference(equality_resolution,[status(thm)],[c_519]) ).
cnf(c_622,plain,
( unordered_pair(X0,X1) != unordered_pair(sK2,sK2)
| X0 = X1
| sK3 = sK2 ),
inference(superposition,[status(thm)],[c_583,c_59]) ).
cnf(c_687,plain,
sK2 = sK4,
inference(forward_subsumption_resolution,[status(thm)],[c_599,c_58]) ).
cnf(c_702,plain,
( sK3 != sK5
| sK2 != sK2 ),
inference(demodulation,[status(thm)],[c_214,c_687]) ).
cnf(c_703,plain,
sK3 != sK5,
inference(equality_resolution_simp,[status(thm)],[c_702]) ).
cnf(c_743,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK2,sK5)
| unordered_pair(sK2,sK5) = unordered_pair(sK2,sK2) ),
inference(light_normalisation,[status(thm)],[c_483,c_687]) ).
cnf(c_748,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_743,c_376]) ).
cnf(c_790,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK2,sK5)
| unordered_pair(sK2,sK3) = unordered_pair(sK2,sK2) ),
inference(light_normalisation,[status(thm)],[c_496,c_687]) ).
cnf(c_1040,plain,
( unordered_pair(sK2,sK5) = unordered_pair(sK2,sK2)
| sK3 = sK5
| sK5 = sK2 ),
inference(equality_resolution,[status(thm)],[c_748]) ).
cnf(c_1041,plain,
( unordered_pair(sK2,sK5) = unordered_pair(sK2,sK2)
| sK5 = sK2 ),
inference(forward_subsumption_resolution,[status(thm)],[c_1040,c_703]) ).
cnf(c_1133,plain,
( sK3 = sK2
| sK5 = sK2 ),
inference(superposition,[status(thm)],[c_1041,c_622]) ).
cnf(c_1143,plain,
( unordered_pair(X0,X0) != unordered_pair(sK2,sK2)
| sK5 = sK2 ),
inference(superposition,[status(thm)],[c_1041,c_59]) ).
cnf(c_1183,plain,
( unordered_pair(sK2,sK2) != unordered_pair(sK2,sK2)
| sK5 = sK2 ),
inference(instantiation,[status(thm)],[c_1143]) ).
cnf(c_1196,plain,
sK5 = sK2,
inference(global_subsumption_just,[status(thm)],[c_1133,c_61,c_1183]) ).
cnf(c_1213,plain,
unordered_pair(sK2,sK3) = unordered_pair(sK2,sK2),
inference(demodulation,[status(thm)],[c_790,c_1196]) ).
cnf(c_1216,plain,
sK3 != sK2,
inference(demodulation,[status(thm)],[c_703,c_1196]) ).
cnf(c_1243,plain,
( unordered_pair(X0,X0) != unordered_pair(sK2,sK2)
| sK3 = sK2 ),
inference(superposition,[status(thm)],[c_1213,c_59]) ).
cnf(c_1247,plain,
unordered_pair(X0,X0) != unordered_pair(sK2,sK2),
inference(forward_subsumption_resolution,[status(thm)],[c_1243,c_1216]) ).
cnf(c_1257,plain,
unordered_pair(sK2,sK2) != unordered_pair(sK2,sK2),
inference(instantiation,[status(thm)],[c_1247]) ).
cnf(c_1258,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1257,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU156+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n032.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu May 2 17:53:53 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.17/0.41 Running first-order theorem proving
% 0.17/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.37/1.05 % SZS status Started for theBenchmark.p
% 0.37/1.05 % SZS status Theorem for theBenchmark.p
% 0.37/1.05
% 0.37/1.05 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.37/1.05
% 0.37/1.05 ------ iProver source info
% 0.37/1.05
% 0.37/1.05 git: date: 2024-05-02 19:28:25 +0000
% 0.37/1.05 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.37/1.05 git: non_committed_changes: false
% 0.37/1.05
% 0.37/1.05 ------ Parsing...
% 0.37/1.05 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.37/1.05
% 0.37/1.05 ------ 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
% 0.37/1.05
% 0.37/1.05 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.37/1.05
% 0.37/1.05 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.37/1.05 ------ Proving...
% 0.37/1.05 ------ Problem Properties
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05 clauses 10
% 0.37/1.05 conjectures 1
% 0.37/1.05 EPR 3
% 0.37/1.05 Horn 9
% 0.37/1.05 unary 5
% 0.37/1.05 binary 4
% 0.37/1.05 lits 16
% 0.37/1.05 lits eq 13
% 0.37/1.05 fd_pure 0
% 0.37/1.05 fd_pseudo 0
% 0.37/1.05 fd_cond 0
% 0.37/1.05 fd_pseudo_cond 4
% 0.37/1.05 AC symbols 0
% 0.37/1.05
% 0.37/1.05 ------ Schedule dynamic 5 is on
% 0.37/1.05
% 0.37/1.05 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05 ------
% 0.37/1.05 Current options:
% 0.37/1.05 ------
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05 ------ Proving...
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05 % SZS status Theorem for theBenchmark.p
% 0.37/1.05
% 0.37/1.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.37/1.05
% 0.37/1.05
%------------------------------------------------------------------------------