TSTP Solution File: LAT381+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LAT381+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 02:35:38 EDT 2024
% Result : Theorem 0.46s 1.14s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 66 ( 26 unt; 0 def)
% Number of atoms : 227 ( 30 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 295 ( 134 ~; 126 |; 25 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 93 ( 0 sgn 51 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(f8,axiom,
! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mASymm) ).
fof(f13,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
=> ! [X2] :
( aSupremumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( aUpperBoundOfIn0(X3,X1,X0)
=> sdtlseqdt0(X2,X3) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSup) ).
fof(f14,axiom,
aSet0(xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__725) ).
fof(f15,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__725_01) ).
fof(f16,axiom,
( aSupremumOfIn0(xv,xS,xT)
& aSupremumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__744) ).
fof(f17,conjecture,
xu = xv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f18,negated_conjecture,
xu != xv,
inference(negated_conjecture,[],[f17]) ).
fof(f22,plain,
xu != xv,
inference(flattening,[],[f18]) ).
fof(f23,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f27,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f28,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f27]) ).
fof(f34,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( aSupremumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f59,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) )
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f34]) ).
fof(f60,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) )
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(flattening,[],[f59]) ).
fof(f61,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) )
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X4] :
( sdtlseqdt0(X2,X4)
| ~ aUpperBoundOfIn0(X4,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(rectify,[],[f60]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) )
=> ( ~ sdtlseqdt0(X2,sK5(X0,X1,X2))
& aUpperBoundOfIn0(sK5(X0,X1,X2),X1,X0) ) ),
introduced(choice_axiom,[]) ).
fof(f63,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ( ~ sdtlseqdt0(X2,sK5(X0,X1,X2))
& aUpperBoundOfIn0(sK5(X0,X1,X2),X1,X0) )
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X4] :
( sdtlseqdt0(X2,X4)
| ~ aUpperBoundOfIn0(X4,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f61,f62]) ).
fof(f64,plain,
! [X0,X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f72,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f87,plain,
! [X2,X0,X1] :
( aElementOf0(X2,X0)
| ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f88,plain,
! [X2,X0,X1] :
( aUpperBoundOfIn0(X2,X1,X0)
| ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f89,plain,
! [X2,X0,X1,X4] :
( sdtlseqdt0(X2,X4)
| ~ aUpperBoundOfIn0(X4,X1,X0)
| ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f92,plain,
aSet0(xT),
inference(cnf_transformation,[],[f14]) ).
fof(f93,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f15]) ).
fof(f94,plain,
aSupremumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f95,plain,
aSupremumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f96,plain,
xu != xv,
inference(cnf_transformation,[],[f22]) ).
cnf(c_49,plain,
( ~ aElementOf0(X0,X1)
| ~ aSet0(X1)
| aElement0(X0) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_57,plain,
( ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f72]) ).
cnf(c_74,plain,
( ~ aUpperBoundOfIn0(X0,X1,X2)
| ~ aSupremumOfIn0(X3,X1,X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| sdtlseqdt0(X3,X0) ),
inference(cnf_transformation,[],[f89]) ).
cnf(c_75,plain,
( ~ aSupremumOfIn0(X0,X1,X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aUpperBoundOfIn0(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_76,plain,
( ~ aSupremumOfIn0(X0,X1,X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aElementOf0(X0,X2) ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_77,plain,
aSet0(xT),
inference(cnf_transformation,[],[f92]) ).
cnf(c_78,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f93]) ).
cnf(c_79,plain,
aSupremumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f95]) ).
cnf(c_80,plain,
aSupremumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f94]) ).
cnf(c_81,negated_conjecture,
xv != xu,
inference(cnf_transformation,[],[f96]) ).
cnf(c_750,plain,
( X0 != xv
| X1 != xS
| X2 != xT
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aElementOf0(X0,X2) ),
inference(resolution_lifted,[status(thm)],[c_76,c_79]) ).
cnf(c_751,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| aElementOf0(xv,xT) ),
inference(unflattening,[status(thm)],[c_750]) ).
cnf(c_752,plain,
aElementOf0(xv,xT),
inference(global_subsumption_just,[status(thm)],[c_751,c_77,c_78,c_751]) ).
cnf(c_757,plain,
( X0 != xv
| X1 != xS
| X2 != xT
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aUpperBoundOfIn0(X0,X1,X2) ),
inference(resolution_lifted,[status(thm)],[c_75,c_79]) ).
cnf(c_758,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| aUpperBoundOfIn0(xv,xS,xT) ),
inference(unflattening,[status(thm)],[c_757]) ).
cnf(c_759,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(global_subsumption_just,[status(thm)],[c_758,c_77,c_78,c_758]) ).
cnf(c_764,plain,
( X0 != xu
| X1 != xS
| X2 != xT
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aElementOf0(X0,X2) ),
inference(resolution_lifted,[status(thm)],[c_76,c_80]) ).
cnf(c_765,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| aElementOf0(xu,xT) ),
inference(unflattening,[status(thm)],[c_764]) ).
cnf(c_766,plain,
aElementOf0(xu,xT),
inference(global_subsumption_just,[status(thm)],[c_765,c_77,c_78,c_765]) ).
cnf(c_771,plain,
( X0 != xu
| X1 != xS
| X2 != xT
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aUpperBoundOfIn0(X0,X1,X2) ),
inference(resolution_lifted,[status(thm)],[c_75,c_80]) ).
cnf(c_772,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| aUpperBoundOfIn0(xu,xS,xT) ),
inference(unflattening,[status(thm)],[c_771]) ).
cnf(c_773,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(global_subsumption_just,[status(thm)],[c_772,c_77,c_78,c_772]) ).
cnf(c_778,plain,
( X0 != xS
| X1 != xT
| X2 != xv
| ~ aUpperBoundOfIn0(X3,X0,X1)
| ~ aSubsetOf0(X0,X1)
| ~ aSet0(X1)
| sdtlseqdt0(X2,X3) ),
inference(resolution_lifted,[status(thm)],[c_74,c_79]) ).
cnf(c_779,plain,
( ~ aUpperBoundOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| sdtlseqdt0(xv,X0) ),
inference(unflattening,[status(thm)],[c_778]) ).
cnf(c_781,plain,
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xv,X0) ),
inference(global_subsumption_just,[status(thm)],[c_779,c_77,c_78,c_779]) ).
cnf(c_790,plain,
( X0 != xS
| X1 != xT
| X2 != xu
| ~ aUpperBoundOfIn0(X3,X0,X1)
| ~ aSubsetOf0(X0,X1)
| ~ aSet0(X1)
| sdtlseqdt0(X2,X3) ),
inference(resolution_lifted,[status(thm)],[c_74,c_80]) ).
cnf(c_791,plain,
( ~ aUpperBoundOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| sdtlseqdt0(xu,X0) ),
inference(unflattening,[status(thm)],[c_790]) ).
cnf(c_793,plain,
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xu,X0) ),
inference(global_subsumption_just,[status(thm)],[c_791,c_77,c_78,c_791]) ).
cnf(c_3109,negated_conjecture,
xv != xu,
inference(demodulation,[status(thm)],[c_81]) ).
cnf(c_3678,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(superposition,[status(thm)],[c_752,c_49]) ).
cnf(c_3679,plain,
( ~ aSet0(xT)
| aElement0(xu) ),
inference(superposition,[status(thm)],[c_766,c_49]) ).
cnf(c_3680,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[status(thm)],[c_3679,c_77]) ).
cnf(c_3681,plain,
aElement0(xv),
inference(forward_subsumption_resolution,[status(thm)],[c_3678,c_77]) ).
cnf(c_3732,plain,
sdtlseqdt0(xv,xu),
inference(superposition,[status(thm)],[c_773,c_781]) ).
cnf(c_3734,plain,
( ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xv)
| ~ aElement0(xu)
| xv = xu ),
inference(superposition,[status(thm)],[c_3732,c_57]) ).
cnf(c_3735,plain,
~ sdtlseqdt0(xu,xv),
inference(forward_subsumption_resolution,[status(thm)],[c_3734,c_3109,c_3680,c_3681]) ).
cnf(c_3740,plain,
sdtlseqdt0(xu,xv),
inference(superposition,[status(thm)],[c_759,c_793]) ).
cnf(c_3742,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3740,c_3735]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LAT381+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n012.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 18:04:10 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.46/1.14 % SZS status Started for theBenchmark.p
% 0.46/1.14 % SZS status Theorem for theBenchmark.p
% 0.46/1.14
% 0.46/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.14
% 0.46/1.14 ------ iProver source info
% 0.46/1.14
% 0.46/1.14 git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.14 git: non_committed_changes: false
% 0.46/1.14
% 0.46/1.14 ------ Parsing...
% 0.46/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.14
% 0.46/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 0.46/1.14
% 0.46/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.14
% 0.46/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.46/1.14 ------ Proving...
% 0.46/1.14 ------ Problem Properties
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14 clauses 30
% 0.46/1.14 conjectures 1
% 0.46/1.14 EPR 19
% 0.46/1.14 Horn 25
% 0.46/1.14 unary 7
% 0.46/1.14 binary 3
% 0.46/1.14 lits 107
% 0.46/1.14 lits eq 2
% 0.46/1.14 fd_pure 0
% 0.46/1.14 fd_pseudo 0
% 0.46/1.14 fd_cond 0
% 0.46/1.14 fd_pseudo_cond 1
% 0.46/1.14 AC symbols 0
% 0.46/1.14
% 0.46/1.14 ------ Schedule dynamic 5 is on
% 0.46/1.14
% 0.46/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14 ------
% 0.46/1.14 Current options:
% 0.46/1.14 ------
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14 ------ Proving...
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14 % SZS status Theorem for theBenchmark.p
% 0.46/1.14
% 0.46/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.14
% 0.46/1.14
%------------------------------------------------------------------------------