TSTP Solution File: LAT263-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT263-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:26:23 EDT 2024
% Result : Unsatisfiable 0.64s 0.68s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 16 unt; 0 nHn; 17 RR)
% Number of literals : 34 ( 6 equ; 16 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 : 23 ( 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/benchmark/theBenchmark.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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',cls_Tarski_Oglb__dual__lub_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/benchmark/theBenchmark.p',cls_conjecture_1) ).
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/theBenchmark.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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',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(c_0_8,plain,
( 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)) ),
inference(fof_simplification,[status(thm)],[cls_Tarski_OCL_Olub__in__lattice_0]) ).
cnf(c_0_9,plain,
( 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)) ),
c_0_8 ).
cnf(c_0_10,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_11,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_12,negated_conjecture,
~ c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_13,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_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,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_15,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_16,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_17,negated_conjecture,
~ c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a),
c_0_12 ).
cnf(c_0_18,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_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
cls_conjecture_0 ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT263-1 : TPTP v8.2.0. Released v3.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n003.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 21:01:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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/benchmark/theBenchmark.p
% 0.64/0.68 # Version: 3.1.0
% 0.64/0.68 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.64/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.64/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.64/0.68 # Starting sh5l with 300s (1) cores
% 0.64/0.68 # new_bool_3 with pid 30269 completed with status 0
% 0.64/0.68 # Result found by new_bool_3
% 0.64/0.68 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.64/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.64/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.64/0.68 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.64/0.68 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.68 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.64/0.68 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 30272 completed with status 0
% 0.64/0.68 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.64/0.68 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.64/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.64/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.64/0.68 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.64/0.68 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.68 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.64/0.68 # Preprocessing time : 0.006 s
% 0.64/0.68
% 0.64/0.68 # Proof found!
% 0.64/0.68 # SZS status Unsatisfiable
% 0.64/0.68 # SZS output start CNFRefutation
% See solution above
% 0.64/0.68 # Parsed axioms : 2748
% 0.64/0.68 # Removed by relevancy pruning/SinE : 2680
% 0.64/0.68 # Initial clauses : 68
% 0.64/0.68 # Removed in clause preprocessing : 0
% 0.64/0.68 # Initial clauses in saturation : 68
% 0.64/0.68 # Processed clauses : 812
% 0.64/0.68 # ...of these trivial : 50
% 0.64/0.68 # ...subsumed : 479
% 0.64/0.68 # ...remaining for further processing : 283
% 0.64/0.68 # Other redundant clauses eliminated : 0
% 0.64/0.68 # Clauses deleted for lack of memory : 0
% 0.64/0.68 # Backward-subsumed : 27
% 0.64/0.68 # Backward-rewritten : 3
% 0.64/0.68 # Generated clauses : 6308
% 0.64/0.68 # ...of the previous two non-redundant : 5665
% 0.64/0.68 # ...aggressively subsumed : 0
% 0.64/0.68 # Contextual simplify-reflections : 3
% 0.64/0.68 # Paramodulations : 6302
% 0.64/0.68 # Factorizations : 1
% 0.64/0.68 # NegExts : 0
% 0.64/0.68 # Equation resolutions : 5
% 0.64/0.68 # Disequality decompositions : 0
% 0.64/0.68 # Total rewrite steps : 1722
% 0.64/0.68 # ...of those cached : 1370
% 0.64/0.68 # Propositional unsat checks : 0
% 0.64/0.68 # Propositional check models : 0
% 0.64/0.68 # Propositional check unsatisfiable : 0
% 0.64/0.68 # Propositional clauses : 0
% 0.64/0.68 # Propositional clauses after purity: 0
% 0.64/0.68 # Propositional unsat core size : 0
% 0.64/0.68 # Propositional preprocessing time : 0.000
% 0.64/0.68 # Propositional encoding time : 0.000
% 0.64/0.68 # Propositional solver time : 0.000
% 0.64/0.68 # Success case prop preproc time : 0.000
% 0.64/0.68 # Success case prop encoding time : 0.000
% 0.64/0.68 # Success case prop solver time : 0.000
% 0.64/0.68 # Current number of processed clauses : 253
% 0.64/0.68 # Positive orientable unit clauses : 47
% 0.64/0.68 # Positive unorientable unit clauses: 8
% 0.64/0.68 # Negative unit clauses : 8
% 0.64/0.68 # Non-unit-clauses : 190
% 0.64/0.68 # Current number of unprocessed clauses: 4905
% 0.64/0.68 # ...number of literals in the above : 12162
% 0.64/0.68 # Current number of archived formulas : 0
% 0.64/0.68 # Current number of archived clauses : 30
% 0.64/0.68 # Clause-clause subsumption calls (NU) : 5766
% 0.64/0.68 # Rec. Clause-clause subsumption calls : 4713
% 0.64/0.68 # Non-unit clause-clause subsumptions : 428
% 0.64/0.68 # Unit Clause-clause subsumption calls : 148
% 0.64/0.68 # Rewrite failures with RHS unbound : 0
% 0.64/0.68 # BW rewrite match attempts : 109
% 0.64/0.68 # BW rewrite match successes : 31
% 0.64/0.68 # Condensation attempts : 0
% 0.64/0.68 # Condensation successes : 0
% 0.64/0.68 # Termbank termtop insertions : 131333
% 0.64/0.68 # Search garbage collected termcells : 7933
% 0.64/0.68
% 0.64/0.68 # -------------------------------------------------
% 0.64/0.68 # User time : 0.127 s
% 0.64/0.68 # System time : 0.010 s
% 0.64/0.68 # Total time : 0.136 s
% 0.64/0.68 # Maximum resident set size: 4164 pages
% 0.64/0.68
% 0.64/0.68 # -------------------------------------------------
% 0.64/0.68 # User time : 0.177 s
% 0.64/0.68 # System time : 0.015 s
% 0.64/0.68 # Total time : 0.192 s
% 0.64/0.68 # Maximum resident set size: 3468 pages
% 0.64/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------