TSTP Solution File: SEU229+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU229+3 : TPTP v8.1.2. Released v3.2.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:05:07 EDT 2024
% Result : Theorem 4.05s 1.01s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 10
% Syntax : Number of formulae : 77 ( 24 unt; 0 def)
% Number of atoms : 264 ( 115 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 304 ( 117 ~; 122 |; 56 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 198 ( 19 sgn 121 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1,X2,X3] :
( unordered_triple(X0,X1,X2) = X3
<=> ! [X4] :
( in(X4,X3)
<=> ~ ( X2 != X4
& X1 != X4
& X0 != X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_enumset1) ).
fof(f6,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f21,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f22,conjecture,
! [X0,X1,X2] :
~ ( in(X2,X0)
& in(X1,X2)
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_ordinal1) ).
fof(f23,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( in(X2,X0)
& in(X1,X2)
& in(X0,X1) ),
inference(negated_conjecture,[],[f22]) ).
fof(f25,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f26,axiom,
! [X0,X1] :
~ ( ! [X2] :
~ ( ! [X3] :
~ ( in(X3,X2)
& in(X3,X1) )
& in(X2,X1) )
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_tarski) ).
fof(f39,plain,
! [X0,X1,X2,X3] :
( unordered_triple(X0,X1,X2) = X3
<=> ! [X4] :
( in(X4,X3)
<=> ( X2 = X4
| X1 = X4
| X0 = X4 ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f41,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f42,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f41]) ).
fof(f43,plain,
? [X0,X1,X2] :
( in(X2,X0)
& in(X1,X2)
& in(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f45,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f46,plain,
! [X0,X1] :
( ? [X2] :
( ! [X3] :
( ~ in(X3,X2)
| ~ in(X3,X1) )
& in(X2,X1) )
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f48,plain,
! [X0,X1,X2,X3] :
( ( unordered_triple(X0,X1,X2) = X3
| ? [X4] :
( ( ( X2 != X4
& X1 != X4
& X0 != X4 )
| ~ in(X4,X3) )
& ( X2 = X4
| X1 = X4
| X0 = X4
| in(X4,X3) ) ) )
& ( ! [X4] :
( ( in(X4,X3)
| ( X2 != X4
& X1 != X4
& X0 != X4 ) )
& ( X2 = X4
| X1 = X4
| X0 = X4
| ~ in(X4,X3) ) )
| unordered_triple(X0,X1,X2) != X3 ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f49,plain,
! [X0,X1,X2,X3] :
( ( unordered_triple(X0,X1,X2) = X3
| ? [X4] :
( ( ( X2 != X4
& X1 != X4
& X0 != X4 )
| ~ in(X4,X3) )
& ( X2 = X4
| X1 = X4
| X0 = X4
| in(X4,X3) ) ) )
& ( ! [X4] :
( ( in(X4,X3)
| ( X2 != X4
& X1 != X4
& X0 != X4 ) )
& ( X2 = X4
| X1 = X4
| X0 = X4
| ~ in(X4,X3) ) )
| unordered_triple(X0,X1,X2) != X3 ) ),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0,X1,X2,X3] :
( ( unordered_triple(X0,X1,X2) = X3
| ? [X4] :
( ( ( X2 != X4
& X1 != X4
& X0 != X4 )
| ~ in(X4,X3) )
& ( X2 = X4
| X1 = X4
| X0 = X4
| in(X4,X3) ) ) )
& ( ! [X5] :
( ( in(X5,X3)
| ( X2 != X5
& X1 != X5
& X0 != X5 ) )
& ( X2 = X5
| X1 = X5
| X0 = X5
| ~ in(X5,X3) ) )
| unordered_triple(X0,X1,X2) != X3 ) ),
inference(rectify,[],[f49]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( ( ( X2 != X4
& X1 != X4
& X0 != X4 )
| ~ in(X4,X3) )
& ( X2 = X4
| X1 = X4
| X0 = X4
| in(X4,X3) ) )
=> ( ( ( sK0(X0,X1,X2,X3) != X2
& sK0(X0,X1,X2,X3) != X1
& sK0(X0,X1,X2,X3) != X0 )
| ~ in(sK0(X0,X1,X2,X3),X3) )
& ( sK0(X0,X1,X2,X3) = X2
| sK0(X0,X1,X2,X3) = X1
| sK0(X0,X1,X2,X3) = X0
| in(sK0(X0,X1,X2,X3),X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
! [X0,X1,X2,X3] :
( ( unordered_triple(X0,X1,X2) = X3
| ( ( ( sK0(X0,X1,X2,X3) != X2
& sK0(X0,X1,X2,X3) != X1
& sK0(X0,X1,X2,X3) != X0 )
| ~ in(sK0(X0,X1,X2,X3),X3) )
& ( sK0(X0,X1,X2,X3) = X2
| sK0(X0,X1,X2,X3) = X1
| sK0(X0,X1,X2,X3) = X0
| in(sK0(X0,X1,X2,X3),X3) ) ) )
& ( ! [X5] :
( ( in(X5,X3)
| ( X2 != X5
& X1 != X5
& X0 != X5 ) )
& ( X2 = X5
| X1 = X5
| X0 = X5
| ~ in(X5,X3) ) )
| unordered_triple(X0,X1,X2) != X3 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f50,f51]) ).
fof(f53,plain,
! [X0] :
( ? [X1] : element(X1,X0)
=> element(sK1(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
! [X0] : element(sK1(X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f6,f53]) ).
fof(f75,plain,
( ? [X0,X1,X2] :
( in(X2,X0)
& in(X1,X2)
& in(X0,X1) )
=> ( in(sK14,sK12)
& in(sK13,sK14)
& in(sK12,sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f76,plain,
( in(sK14,sK12)
& in(sK13,sK14)
& in(sK12,sK13) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14])],[f43,f75]) ).
fof(f77,plain,
! [X1] :
( ? [X2] :
( ! [X3] :
( ~ in(X3,X2)
| ~ in(X3,X1) )
& in(X2,X1) )
=> ( ! [X3] :
( ~ in(X3,sK15(X1))
| ~ in(X3,X1) )
& in(sK15(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f78,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ in(X3,sK15(X1))
| ~ in(X3,X1) )
& in(sK15(X1),X1) )
| ~ in(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15])],[f46,f77]) ).
fof(f84,plain,
! [X2,X3,X0,X1,X5] :
( X2 = X5
| X1 = X5
| X0 = X5
| ~ in(X5,X3)
| unordered_triple(X0,X1,X2) != X3 ),
inference(cnf_transformation,[],[f52]) ).
fof(f85,plain,
! [X2,X3,X0,X1,X5] :
( in(X5,X3)
| X0 != X5
| unordered_triple(X0,X1,X2) != X3 ),
inference(cnf_transformation,[],[f52]) ).
fof(f86,plain,
! [X2,X3,X0,X1,X5] :
( in(X5,X3)
| X1 != X5
| unordered_triple(X0,X1,X2) != X3 ),
inference(cnf_transformation,[],[f52]) ).
fof(f87,plain,
! [X2,X3,X0,X1,X5] :
( in(X5,X3)
| X2 != X5
| unordered_triple(X0,X1,X2) != X3 ),
inference(cnf_transformation,[],[f52]) ).
fof(f92,plain,
! [X0] : element(sK1(X0),X0),
inference(cnf_transformation,[],[f54]) ).
fof(f117,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f118,plain,
in(sK12,sK13),
inference(cnf_transformation,[],[f76]) ).
fof(f119,plain,
in(sK13,sK14),
inference(cnf_transformation,[],[f76]) ).
fof(f120,plain,
in(sK14,sK12),
inference(cnf_transformation,[],[f76]) ).
fof(f122,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f123,plain,
! [X0,X1] :
( in(sK15(X1),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f124,plain,
! [X3,X0,X1] :
( ~ in(X3,sK15(X1))
| ~ in(X3,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f126,plain,
! [X3,X0,X1,X5] :
( in(X5,X3)
| unordered_triple(X0,X1,X5) != X3 ),
inference(equality_resolution,[],[f87]) ).
fof(f127,plain,
! [X0,X1,X5] : in(X5,unordered_triple(X0,X1,X5)),
inference(equality_resolution,[],[f126]) ).
fof(f128,plain,
! [X2,X3,X0,X5] :
( in(X5,X3)
| unordered_triple(X0,X5,X2) != X3 ),
inference(equality_resolution,[],[f86]) ).
fof(f129,plain,
! [X2,X0,X5] : in(X5,unordered_triple(X0,X5,X2)),
inference(equality_resolution,[],[f128]) ).
fof(f130,plain,
! [X2,X3,X1,X5] :
( in(X5,X3)
| unordered_triple(X5,X1,X2) != X3 ),
inference(equality_resolution,[],[f85]) ).
fof(f131,plain,
! [X2,X1,X5] : in(X5,unordered_triple(X5,X1,X2)),
inference(equality_resolution,[],[f130]) ).
fof(f132,plain,
! [X2,X0,X1,X5] :
( X2 = X5
| X1 = X5
| X0 = X5
| ~ in(X5,unordered_triple(X0,X1,X2)) ),
inference(equality_resolution,[],[f84]) ).
cnf(c_56,plain,
in(X0,unordered_triple(X1,X2,X0)),
inference(cnf_transformation,[],[f127]) ).
cnf(c_57,plain,
in(X0,unordered_triple(X1,X0,X2)),
inference(cnf_transformation,[],[f129]) ).
cnf(c_58,plain,
in(X0,unordered_triple(X0,X1,X2)),
inference(cnf_transformation,[],[f131]) ).
cnf(c_59,plain,
( ~ in(X0,unordered_triple(X1,X2,X3))
| X0 = X1
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f132]) ).
cnf(c_60,plain,
element(sK1(X0),X0),
inference(cnf_transformation,[],[f92]) ).
cnf(c_85,plain,
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f117]) ).
cnf(c_86,negated_conjecture,
in(sK14,sK12),
inference(cnf_transformation,[],[f120]) ).
cnf(c_87,negated_conjecture,
in(sK13,sK14),
inference(cnf_transformation,[],[f119]) ).
cnf(c_88,negated_conjecture,
in(sK12,sK13),
inference(cnf_transformation,[],[f118]) ).
cnf(c_90,plain,
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f122]) ).
cnf(c_91,plain,
( ~ in(X0,sK15(X1))
| ~ in(X0,X1)
| ~ in(X2,X1) ),
inference(cnf_transformation,[],[f124]) ).
cnf(c_92,plain,
( ~ in(X0,X1)
| in(sK15(X1),X1) ),
inference(cnf_transformation,[],[f123]) ).
cnf(c_331,plain,
( sK1(X0) != X1
| X0 != X2
| in(X1,X2)
| empty(X2) ),
inference(resolution_lifted,[status(thm)],[c_60,c_85]) ).
cnf(c_332,plain,
( in(sK1(X0),X0)
| empty(X0) ),
inference(unflattening,[status(thm)],[c_331]) ).
cnf(c_504,negated_conjecture,
in(sK12,sK13),
inference(demodulation,[status(thm)],[c_88]) ).
cnf(c_505,negated_conjecture,
in(sK13,sK14),
inference(demodulation,[status(thm)],[c_87]) ).
cnf(c_506,negated_conjecture,
in(sK14,sK12),
inference(demodulation,[status(thm)],[c_86]) ).
cnf(c_775,plain,
~ empty(unordered_triple(X0,X1,X2)),
inference(superposition,[status(thm)],[c_56,c_90]) ).
cnf(c_787,plain,
in(sK15(unordered_triple(X0,X1,X2)),unordered_triple(X0,X1,X2)),
inference(superposition,[status(thm)],[c_56,c_92]) ).
cnf(c_793,plain,
( in(sK15(X0),X0)
| empty(X0) ),
inference(superposition,[status(thm)],[c_332,c_92]) ).
cnf(c_847,plain,
( sK15(unordered_triple(X0,X1,X2)) = X0
| sK15(unordered_triple(X0,X1,X2)) = X1
| sK15(unordered_triple(X0,X1,X2)) = X2
| empty(unordered_triple(X0,X1,X2)) ),
inference(superposition,[status(thm)],[c_793,c_59]) ).
cnf(c_854,plain,
( sK15(unordered_triple(X0,X1,X2)) = X0
| sK15(unordered_triple(X0,X1,X2)) = X1
| sK15(unordered_triple(X0,X1,X2)) = X2 ),
inference(forward_subsumption_resolution,[status(thm)],[c_847,c_775]) ).
cnf(c_971,plain,
( ~ in(X0,unordered_triple(X1,X2,X3))
| ~ in(X4,unordered_triple(X1,X2,X3))
| ~ in(X0,X3)
| sK15(unordered_triple(X1,X2,X3)) = X1
| sK15(unordered_triple(X1,X2,X3)) = X2 ),
inference(superposition,[status(thm)],[c_854,c_91]) ).
cnf(c_7076,plain,
( ~ in(X0,unordered_triple(X1,X2,X3))
| ~ in(X2,X3)
| sK15(unordered_triple(X1,X2,X3)) = X1
| sK15(unordered_triple(X1,X2,X3)) = X2 ),
inference(superposition,[status(thm)],[c_57,c_971]) ).
cnf(c_7120,plain,
( ~ in(X0,X1)
| sK15(unordered_triple(X2,X0,X1)) = X0
| sK15(unordered_triple(X2,X0,X1)) = X2 ),
inference(superposition,[status(thm)],[c_787,c_7076]) ).
cnf(c_7200,plain,
( sK15(unordered_triple(X0,sK14,sK12)) = X0
| sK15(unordered_triple(X0,sK14,sK12)) = sK14 ),
inference(superposition,[status(thm)],[c_506,c_7120]) ).
cnf(c_7333,plain,
( ~ in(X0,unordered_triple(X1,sK14,sK12))
| ~ in(X2,unordered_triple(X1,sK14,sK12))
| ~ in(X0,sK14)
| sK15(unordered_triple(X1,sK14,sK12)) = X1 ),
inference(superposition,[status(thm)],[c_7200,c_91]) ).
cnf(c_9117,plain,
( ~ in(X0,unordered_triple(X1,sK14,sK12))
| ~ in(X1,sK14)
| sK15(unordered_triple(X1,sK14,sK12)) = X1 ),
inference(superposition,[status(thm)],[c_58,c_7333]) ).
cnf(c_9274,plain,
( ~ in(X0,sK14)
| sK15(unordered_triple(X0,sK14,sK12)) = X0 ),
inference(superposition,[status(thm)],[c_787,c_9117]) ).
cnf(c_9325,plain,
sK15(unordered_triple(sK13,sK14,sK12)) = sK13,
inference(superposition,[status(thm)],[c_505,c_9274]) ).
cnf(c_9377,plain,
( ~ in(X0,unordered_triple(sK13,sK14,sK12))
| ~ in(X1,unordered_triple(sK13,sK14,sK12))
| ~ in(X0,sK13) ),
inference(superposition,[status(thm)],[c_9325,c_91]) ).
cnf(c_9656,plain,
( ~ in(X0,unordered_triple(sK13,sK14,sK12))
| ~ in(sK12,sK13) ),
inference(superposition,[status(thm)],[c_56,c_9377]) ).
cnf(c_9662,plain,
~ in(X0,unordered_triple(sK13,sK14,sK12)),
inference(forward_subsumption_resolution,[status(thm)],[c_9656,c_504]) ).
cnf(c_9665,plain,
$false,
inference(superposition,[status(thm)],[c_56,c_9662]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEU229+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.09 % Command : run_iprover %s %d THM
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Thu May 2 17:41:08 EDT 2024
% 0.12/0.28 % CPUTime :
% 0.12/0.37 Running first-order theorem proving
% 0.12/0.37 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
% 4.05/1.01 % SZS status Started for theBenchmark.p
% 4.05/1.01 % SZS status Theorem for theBenchmark.p
% 4.05/1.01
% 4.05/1.01 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.05/1.01
% 4.05/1.01 ------ iProver source info
% 4.05/1.01
% 4.05/1.01 git: date: 2024-05-02 19:28:25 +0000
% 4.05/1.01 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.05/1.01 git: non_committed_changes: false
% 4.05/1.01
% 4.05/1.01 ------ Parsing...
% 4.05/1.01 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.05/1.01
% 4.05/1.01 ------ Preprocessing... sup_sim: 0 sf_s rm: 19 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 4.05/1.01
% 4.05/1.01 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.05/1.01
% 4.05/1.01 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.05/1.01 ------ Proving...
% 4.05/1.01 ------ Problem Properties
% 4.05/1.01
% 4.05/1.01
% 4.05/1.01 clauses 24
% 4.05/1.01 conjectures 3
% 4.05/1.01 EPR 13
% 4.05/1.01 Horn 21
% 4.05/1.01 unary 12
% 4.05/1.01 binary 5
% 4.05/1.01 lits 46
% 4.05/1.01 lits eq 15
% 4.05/1.01 fd_pure 0
% 4.05/1.01 fd_pseudo 0
% 4.05/1.01 fd_cond 1
% 4.05/1.01 fd_pseudo_cond 5
% 4.05/1.01 AC symbols 0
% 4.05/1.01
% 4.05/1.01 ------ Schedule dynamic 5 is on
% 4.05/1.01
% 4.05/1.01 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.05/1.01
% 4.05/1.01
% 4.05/1.01 ------
% 4.05/1.01 Current options:
% 4.05/1.01 ------
% 4.05/1.01
% 4.05/1.01
% 4.05/1.01
% 4.05/1.01
% 4.05/1.01 ------ Proving...
% 4.05/1.01
% 4.05/1.01
% 4.05/1.01 % SZS status Theorem for theBenchmark.p
% 4.05/1.01
% 4.05/1.01 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.05/1.01
% 4.05/1.02
%------------------------------------------------------------------------------