TSTP Solution File: LAT263-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT263-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:10:15 EDT 2023
% Result : Unsatisfiable 0.48s 0.80s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 19 ( 15 unt; 0 nHn; 15 RR)
% Number of literals : 29 ( 6 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Tarski_OCL_Olub__in__lattice_0,axiom,
( c_in(c_Tarski_Olub(X3,X1,X2),c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),X2)
| ~ c_in(X1,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit))
| ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit))
| ~ c_lessequals(X3,c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),tc_set(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.ZgC7HZM48F/E---3.1_5837.p',cls_Tarski_OCL_Olub__in__lattice_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/tmp/tmp.ZgC7HZM48F/E---3.1_5837.p',cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_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/tmp/tmp.ZgC7HZM48F/E---3.1_5837.p',cls_Tarski_Oglb__dual__lub_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/tmp/tmp.ZgC7HZM48F/E---3.1_5837.p',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/tmp/tmp.ZgC7HZM48F/E---3.1_5837.p',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/tmp/tmp.ZgC7HZM48F/E---3.1_5837.p',cls_Tarski_Odual_Acl_A_58_APartialOrder_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a),
file('/export/starexec/sandbox/tmp/tmp.ZgC7HZM48F/E---3.1_5837.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox/tmp/tmp.ZgC7HZM48F/E---3.1_5837.p',cls_conjecture_0) ).
cnf(c_0_8,axiom,
( c_in(c_Tarski_Olub(X3,X1,X2),c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),X2)
| ~ c_in(X1,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit))
| ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit))
| ~ c_lessequals(X3,c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),tc_set(X2)) ),
cls_Tarski_OCL_Olub__in__lattice_0 ).
cnf(c_0_9,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_10,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_11,plain,
( c_in(c_Tarski_Oglb(X1,X2,X3),c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),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)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,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_13,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_14,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_15,negated_conjecture,
~ c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a),
cls_conjecture_1 ).
cnf(c_0_16,plain,
( c_in(c_Tarski_Oglb(X1,v_cl,t_a),v_A,t_a)
| ~ c_lessequals(X1,v_A,tc_set(t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
cls_conjecture_0 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : LAT263-1 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 11:08:31 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.39/0.64 Running first-order model finding
% 0.39/0.64 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ZgC7HZM48F/E---3.1_5837.p
% 0.48/0.80 # Version: 3.1pre001
% 0.48/0.80 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.48/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.80 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.80 # Starting new_bool_3 with 300s (1) cores
% 0.48/0.80 # Starting new_bool_1 with 300s (1) cores
% 0.48/0.80 # Starting sh5l with 300s (1) cores
% 0.48/0.80 # new_bool_3 with pid 5917 completed with status 0
% 0.48/0.80 # Result found by new_bool_3
% 0.48/0.80 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.48/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.80 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.80 # Starting new_bool_3 with 300s (1) cores
% 0.48/0.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.48/0.80 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.48/0.80 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.48/0.80 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.48/0.80 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 5922 completed with status 0
% 0.48/0.80 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.48/0.80 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.48/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.80 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.80 # Starting new_bool_3 with 300s (1) cores
% 0.48/0.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.48/0.80 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.48/0.80 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.48/0.80 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.48/0.80 # Preprocessing time : 0.005 s
% 0.48/0.80
% 0.48/0.80 # Proof found!
% 0.48/0.80 # SZS status Unsatisfiable
% 0.48/0.80 # SZS output start CNFRefutation
% See solution above
% 0.48/0.80 # Parsed axioms : 2748
% 0.48/0.80 # Removed by relevancy pruning/SinE : 2680
% 0.48/0.80 # Initial clauses : 68
% 0.48/0.80 # Removed in clause preprocessing : 0
% 0.48/0.80 # Initial clauses in saturation : 68
% 0.48/0.80 # Processed clauses : 812
% 0.48/0.80 # ...of these trivial : 51
% 0.48/0.80 # ...subsumed : 472
% 0.48/0.80 # ...remaining for further processing : 289
% 0.48/0.80 # Other redundant clauses eliminated : 0
% 0.48/0.80 # Clauses deleted for lack of memory : 0
% 0.48/0.80 # Backward-subsumed : 26
% 0.48/0.80 # Backward-rewritten : 3
% 0.48/0.80 # Generated clauses : 6226
% 0.48/0.80 # ...of the previous two non-redundant : 5594
% 0.48/0.80 # ...aggressively subsumed : 0
% 0.48/0.80 # Contextual simplify-reflections : 3
% 0.48/0.80 # Paramodulations : 6219
% 0.48/0.80 # Factorizations : 1
% 0.48/0.80 # NegExts : 0
% 0.48/0.80 # Equation resolutions : 6
% 0.48/0.80 # Total rewrite steps : 1710
% 0.48/0.80 # Propositional unsat checks : 0
% 0.48/0.80 # Propositional check models : 0
% 0.48/0.80 # Propositional check unsatisfiable : 0
% 0.48/0.80 # Propositional clauses : 0
% 0.48/0.80 # Propositional clauses after purity: 0
% 0.48/0.80 # Propositional unsat core size : 0
% 0.48/0.80 # Propositional preprocessing time : 0.000
% 0.48/0.80 # Propositional encoding time : 0.000
% 0.48/0.80 # Propositional solver time : 0.000
% 0.48/0.80 # Success case prop preproc time : 0.000
% 0.48/0.80 # Success case prop encoding time : 0.000
% 0.48/0.80 # Success case prop solver time : 0.000
% 0.48/0.80 # Current number of processed clauses : 260
% 0.48/0.80 # Positive orientable unit clauses : 47
% 0.48/0.80 # Positive unorientable unit clauses: 8
% 0.48/0.80 # Negative unit clauses : 8
% 0.48/0.80 # Non-unit-clauses : 197
% 0.48/0.80 # Current number of unprocessed clauses: 4834
% 0.48/0.80 # ...number of literals in the above : 11973
% 0.48/0.80 # Current number of archived formulas : 0
% 0.48/0.80 # Current number of archived clauses : 29
% 0.48/0.80 # Clause-clause subsumption calls (NU) : 6120
% 0.48/0.80 # Rec. Clause-clause subsumption calls : 5004
% 0.48/0.80 # Non-unit clause-clause subsumptions : 419
% 0.48/0.80 # Unit Clause-clause subsumption calls : 148
% 0.48/0.80 # Rewrite failures with RHS unbound : 0
% 0.48/0.80 # BW rewrite match attempts : 109
% 0.48/0.80 # BW rewrite match successes : 31
% 0.48/0.80 # Condensation attempts : 0
% 0.48/0.80 # Condensation successes : 0
% 0.48/0.80 # Termbank termtop insertions : 130445
% 0.48/0.80
% 0.48/0.80 # -------------------------------------------------
% 0.48/0.80 # User time : 0.077 s
% 0.48/0.80 # System time : 0.011 s
% 0.48/0.80 # Total time : 0.088 s
% 0.48/0.80 # Maximum resident set size: 4132 pages
% 0.48/0.80
% 0.48/0.80 # -------------------------------------------------
% 0.48/0.80 # User time : 0.109 s
% 0.48/0.80 # System time : 0.013 s
% 0.48/0.80 # Total time : 0.122 s
% 0.48/0.80 # Maximum resident set size: 3480 pages
% 0.48/0.80 % E---3.1 exiting
%------------------------------------------------------------------------------