TSTP Solution File: LAT268-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT268-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : Mon May 20 23:24:10 EDT 2024
% Result : Unsatisfiable 18.53s 2.93s
% Output : CNFRefutation 18.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 28 ( 20 unt; 0 nHn; 24 RR)
% Number of literals : 49 ( 8 equ; 24 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 9 con; 0-4 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0,axiom,
( c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0) ).
cnf(cls_Tarski_OCL_Olub__upper_0,axiom,
( c_in(c_Pair(X1,c_Tarski_Olub(X2,X4,X3),X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3))
| ~ c_in(X1,X2,X3)
| ~ c_in(X4,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(X4,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_lessequals(X2,c_Tarski_Opotype_Opset(X4,X3,tc_Product__Type_Ounit),tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_OCL_Olub__upper_0) ).
cnf(cls_Tarski_Oglb__dual__lub_0,axiom,
c_Tarski_Oglb(X1,X2,X3) = c_Tarski_Olub(X1,c_Tarski_Odual(X2,X3),X3),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_Oglb__dual__lub_0) ).
cnf(cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0,axiom,
c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Tarski_Or_A_61_61_Aorder_Acl_0,axiom,
v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_Or_A_61_61_Aorder_Acl_0) ).
cnf(cls_Tarski_OA_A_61_61_Apset_Acl_0,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_OA_A_61_61_Apset_Acl_0) ).
cnf(cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0) ).
cnf(cls_Tarski_Odual_Acl_A_58_APartialOrder_0,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_Odual_Acl_A_58_APartialOrder_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_x,v_S,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_11,plain,
( c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)) ),
inference(fof_simplification,[status(thm)],[cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0]) ).
cnf(c_0_12,plain,
( c_in(c_Pair(X1,c_Tarski_Olub(X2,X4,X3),X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3))
| ~ c_in(X1,X2,X3)
| ~ c_in(X4,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(X4,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_lessequals(X2,c_Tarski_Opotype_Opset(X4,X3,tc_Product__Type_Ounit),tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Tarski_OCL_Olub__upper_0]) ).
cnf(c_0_13,plain,
( c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)) ),
c_0_11 ).
cnf(c_0_14,plain,
( c_in(c_Pair(X1,c_Tarski_Olub(X2,X4,X3),X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3))
| ~ c_in(X1,X2,X3)
| ~ c_in(X4,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(X4,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_lessequals(X2,c_Tarski_Opotype_Opset(X4,X3,tc_Product__Type_Ounit),tc_set(X3)) ),
c_0_12 ).
cnf(c_0_15,axiom,
c_Tarski_Oglb(X1,X2,X3) = c_Tarski_Olub(X1,c_Tarski_Odual(X2,X3),X3),
cls_Tarski_Oglb__dual__lub_0 ).
cnf(c_0_16,axiom,
c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),
cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0 ).
cnf(c_0_17,negated_conjecture,
~ c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_18,plain,
( c_in(c_Pair(c_Tarski_Oglb(X1,X2,X3),X4,X3,X3),c_Tarski_Opotype_Oorder(X2,X3,tc_Product__Type_Ounit),tc_prod(X3,X3))
| ~ c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3))
| ~ c_in(c_Tarski_Odual(X2,X3),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(c_Tarski_Odual(X2,X3),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(X4,X1,X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]) ).
cnf(c_0_19,axiom,
v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
cls_Tarski_Or_A_61_61_Aorder_Acl_0 ).
cnf(c_0_20,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
cls_Tarski_OA_A_61_61_Apset_Acl_0 ).
cnf(c_0_21,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0 ).
cnf(c_0_22,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
cls_Tarski_Odual_Acl_A_58_APartialOrder_0 ).
cnf(c_0_23,negated_conjecture,
~ c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
c_0_17 ).
cnf(c_0_24,plain,
( c_in(c_Pair(c_Tarski_Oglb(X1,v_cl,t_a),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_lessequals(X1,v_A,tc_set(t_a))
| ~ c_in(X2,X1,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
cls_conjecture_0 ).
cnf(c_0_26,negated_conjecture,
c_in(v_x,v_S,t_a),
cls_conjecture_1 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LAT268-1 : TPTP v8.2.0. Released v3.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 19:42:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.53/2.93 # Version: 3.1.0
% 18.53/2.93 # Preprocessing class: FMLMSMSMSSSNFFN.
% 18.53/2.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.53/2.93 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.53/2.93 # Starting new_bool_3 with 300s (1) cores
% 18.53/2.93 # Starting new_bool_1 with 300s (1) cores
% 18.53/2.93 # Starting sh5l with 300s (1) cores
% 18.53/2.93 # new_bool_3 with pid 16020 completed with status 0
% 18.53/2.93 # Result found by new_bool_3
% 18.53/2.93 # Preprocessing class: FMLMSMSMSSSNFFN.
% 18.53/2.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.53/2.93 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.53/2.93 # Starting new_bool_3 with 300s (1) cores
% 18.53/2.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 18.53/2.93 # Search class: FGHSM-FSLM32-MFFFFFNN
% 18.53/2.93 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 18.53/2.93 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 18.53/2.93 # G-E--_303_C18_F1_URBAN_S0Y with pid 16032 completed with status 0
% 18.53/2.93 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 18.53/2.93 # Preprocessing class: FMLMSMSMSSSNFFN.
% 18.53/2.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.53/2.93 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.53/2.93 # Starting new_bool_3 with 300s (1) cores
% 18.53/2.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 18.53/2.93 # Search class: FGHSM-FSLM32-MFFFFFNN
% 18.53/2.93 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 18.53/2.93 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 18.53/2.93 # Preprocessing time : 0.019 s
% 18.53/2.93
% 18.53/2.93 # Proof found!
% 18.53/2.93 # SZS status Unsatisfiable
% 18.53/2.93 # SZS output start CNFRefutation
% See solution above
% 18.53/2.93 # Parsed axioms : 2752
% 18.53/2.93 # Removed by relevancy pruning/SinE : 2290
% 18.53/2.93 # Initial clauses : 462
% 18.53/2.93 # Removed in clause preprocessing : 0
% 18.53/2.93 # Initial clauses in saturation : 462
% 18.53/2.93 # Processed clauses : 6021
% 18.53/2.93 # ...of these trivial : 74
% 18.53/2.93 # ...subsumed : 3423
% 18.53/2.93 # ...remaining for further processing : 2524
% 18.53/2.93 # Other redundant clauses eliminated : 40
% 18.53/2.93 # Clauses deleted for lack of memory : 0
% 18.53/2.93 # Backward-subsumed : 86
% 18.53/2.93 # Backward-rewritten : 107
% 18.53/2.93 # Generated clauses : 89205
% 18.53/2.93 # ...of the previous two non-redundant : 79784
% 18.53/2.93 # ...aggressively subsumed : 0
% 18.53/2.93 # Contextual simplify-reflections : 103
% 18.53/2.93 # Paramodulations : 89108
% 18.53/2.93 # Factorizations : 10
% 18.53/2.93 # NegExts : 0
% 18.53/2.93 # Equation resolutions : 86
% 18.53/2.93 # Disequality decompositions : 0
% 18.53/2.93 # Total rewrite steps : 49553
% 18.53/2.93 # ...of those cached : 45644
% 18.53/2.93 # Propositional unsat checks : 0
% 18.53/2.93 # Propositional check models : 0
% 18.53/2.93 # Propositional check unsatisfiable : 0
% 18.53/2.93 # Propositional clauses : 0
% 18.53/2.93 # Propositional clauses after purity: 0
% 18.53/2.93 # Propositional unsat core size : 0
% 18.53/2.93 # Propositional preprocessing time : 0.000
% 18.53/2.93 # Propositional encoding time : 0.000
% 18.53/2.93 # Propositional solver time : 0.000
% 18.53/2.93 # Success case prop preproc time : 0.000
% 18.53/2.93 # Success case prop encoding time : 0.000
% 18.53/2.93 # Success case prop solver time : 0.000
% 18.53/2.93 # Current number of processed clauses : 2330
% 18.53/2.93 # Positive orientable unit clauses : 132
% 18.53/2.93 # Positive unorientable unit clauses: 9
% 18.53/2.93 # Negative unit clauses : 168
% 18.53/2.93 # Non-unit-clauses : 2021
% 18.53/2.93 # Current number of unprocessed clauses: 74039
% 18.53/2.93 # ...number of literals in the above : 350408
% 18.53/2.93 # Current number of archived formulas : 0
% 18.53/2.93 # Current number of archived clauses : 194
% 18.53/2.93 # Clause-clause subsumption calls (NU) : 789211
% 18.53/2.93 # Rec. Clause-clause subsumption calls : 148805
% 18.53/2.93 # Non-unit clause-clause subsumptions : 1311
% 18.53/2.93 # Unit Clause-clause subsumption calls : 17503
% 18.53/2.93 # Rewrite failures with RHS unbound : 0
% 18.53/2.93 # BW rewrite match attempts : 332
% 18.53/2.93 # BW rewrite match successes : 59
% 18.53/2.93 # Condensation attempts : 0
% 18.53/2.93 # Condensation successes : 0
% 18.53/2.93 # Termbank termtop insertions : 2388286
% 18.53/2.93 # Search garbage collected termcells : 7261
% 18.53/2.93
% 18.53/2.93 # -------------------------------------------------
% 18.53/2.93 # User time : 2.270 s
% 18.53/2.93 # System time : 0.064 s
% 18.53/2.93 # Total time : 2.335 s
% 18.53/2.93 # Maximum resident set size: 4408 pages
% 18.53/2.93
% 18.53/2.93 # -------------------------------------------------
% 18.53/2.93 # User time : 2.324 s
% 18.53/2.93 # System time : 0.068 s
% 18.53/2.93 # Total time : 2.392 s
% 18.53/2.93 # Maximum resident set size: 3472 pages
% 18.53/2.93 % E---3.1 exiting
% 18.53/2.93 % E exiting
%------------------------------------------------------------------------------