TSTP Solution File: LAT268-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT268-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:08:13 EDT 2023
% Result : Timeout 408.22s 300.20s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of clauses : 25 ( 19 unt; 0 nHn; 21 RR)
% Number of literals : 41 ( 8 equ; 18 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 : 32 ( 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/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p',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/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p',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/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p',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/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p',cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0) ).
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/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p',cls_Tarski_Or_A_61_61_Aorder_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/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.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/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p',cls_Tarski_Odual_Acl_A_58_APartialOrder_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/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p',cls_Tarski_OA_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/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p',cls_conjecture_2) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_x,v_S,t_a),
file('/export/starexec/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p',cls_conjecture_0) ).
cnf(c_0_11,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)) ),
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,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)) ),
cls_Tarski_OCL_Olub__upper_0 ).
cnf(c_0_13,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_14,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_15,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_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)
| ~ c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3)) ),
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_16,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_17,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_18,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_19,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_20,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)),
cls_conjecture_2 ).
cnf(c_0_21,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_in(X2,X1,t_a)
| ~ c_lessequals(X1,v_A,tc_set(t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
c_in(v_x,v_S,t_a),
cls_conjecture_1 ).
cnf(c_0_23,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
cls_conjecture_0 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : LAT268-2 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n026.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 10:21:44 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.q8S8YSnwOB/E---3.1_20532.p
% 408.22/300.20 # Version: 3.1pre001
% 408.22/300.20 # Preprocessing class: FSMSSMSMSSSNFFN.
% 408.22/300.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.22/300.20 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 408.22/300.20 # Starting new_bool_3 with 300s (1) cores
% 408.22/300.20 # Starting new_bool_1 with 300s (1) cores
% 408.22/300.20 # Starting sh5l with 300s (1) cores
% 408.22/300.20 # new_bool_3 with pid 20624 completed with status 0
% 408.22/300.20 # Result found by new_bool_3
% 408.22/300.20 # Preprocessing class: FSMSSMSMSSSNFFN.
% 408.22/300.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.22/300.20 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 408.22/300.20 # Starting new_bool_3 with 300s (1) cores
% 408.22/300.20 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.22/300.20 # Search class: FHUSS-FFSM32-SFFFFFNN
% 408.22/300.20 # partial match(1): FHUSS-FFSM22-SFFFFFNN
% 408.22/300.20 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.22/300.20 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 181s (1) cores
% 408.22/300.20 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 20631 completed with status 0
% 408.22/300.20 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 408.22/300.20 # Preprocessing class: FSMSSMSMSSSNFFN.
% 408.22/300.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.22/300.20 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 408.22/300.20 # Starting new_bool_3 with 300s (1) cores
% 408.22/300.20 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.22/300.20 # Search class: FHUSS-FFSM32-SFFFFFNN
% 408.22/300.20 # partial match(1): FHUSS-FFSM22-SFFFFFNN
% 408.22/300.20 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.22/300.20 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 181s (1) cores
% 408.22/300.20 # Preprocessing time : 0.001 s
% 408.22/300.20
% 408.22/300.20 # Proof found!
% 408.22/300.20 # SZS status Unsatisfiable
% 408.22/300.20 # SZS output start CNFRefutation
% See solution above
% 408.22/300.20 # Parsed axioms : 11
% 408.22/300.20 # Removed by relevancy pruning/SinE : 0
% 408.22/300.20 # Initial clauses : 11
% 408.22/300.20 # Removed in clause preprocessing : 0
% 408.22/300.20 # Initial clauses in saturation : 11
% 408.22/300.20 # Processed clauses : 14
% 408.22/300.20 # ...of these trivial : 0
% 408.22/300.20 # ...subsumed : 0
% 408.22/300.20 # ...remaining for further processing : 14
% 408.22/300.20 # Other redundant clauses eliminated : 0
% 408.22/300.20 # Clauses deleted for lack of memory : 0
% 408.22/300.20 # Backward-subsumed : 0
% 408.22/300.20 # Backward-rewritten : 0
% 408.22/300.20 # Generated clauses : 6
% 408.22/300.20 # ...of the previous two non-redundant : 5
% 408.22/300.20 # ...aggressively subsumed : 0
% 408.22/300.20 # Contextual simplify-reflections : 0
% 408.22/300.20 # Paramodulations : 6
% 408.22/300.20 # Factorizations : 0
% 408.22/300.20 # NegExts : 0
% 408.22/300.20 # Equation resolutions : 0
% 408.22/300.20 # Total rewrite steps : 10
% 408.22/300.20 # Propositional unsat checks : 0
% 408.22/300.20 # Propositional check models : 0
% 408.22/300.20 # Propositional check unsatisfiable : 0
% 408.22/300.20 # Propositional clauses : 0
% 408.22/300.20 # Propositional clauses after purity: 0
% 408.22/300.20 # Propositional unsat core size : 0
% 408.22/300.20 # Propositional preprocessing time : 0.000
% 408.22/300.20 # Propositional encoding time : 0.000
% 408.22/300.20 # Propositional solver time : 0.000
% 408.22/300.20 # Success case prop preproc time : 0.000
% 408.22/300.20 # Success case prop encoding time : 0.000
% 408.22/300.20 # Success case prop solver time : 0.000
% 408.22/300.20 # Current number of processed clauses : 14
% 408.22/300.20 # Positive orientable unit clauses : 8
% 408.22/300.20 # Positive unorientable unit clauses: 0
% 408.22/300.20 # Negative unit clauses : 1
% 408.22/300.20 # Non-unit-clauses : 5
% 408.22/300.20 # Current number of unprocessed clauses: 2
% 408.22/300.20 # ...number of literals in the above : 10
% 408.22/300.20 # Current number of archived formulas : 0
% 408.22/300.20 # Current number of archived clauses : 0
% 408.22/300.20 # Clause-clause subsumption calls (NU) : 6
% 408.22/300.20 # Rec. Clause-clause subsumption calls : 0
% 408.22/300.20 # Non-unit clause-clause subsumptions : 0
% 408.22/300.20 # Unit Clause-clause subsumption calls : 0
% 408.22/300.20 # Rewrite failures with RHS unbound : 0
% 408.22/300.20 # BW rewrite match attempts : 0
% 408.22/300.20 # BW rewrite match successes : 0
% 408.22/300.20 # Condensation attempts : 0
% 408.22/300.20 # Condensation successes : 0
% 408.22/300.20 # Termbank termtop insertions : 564
% 408.22/300.20
% 408.22/300.20 # -------------------------------------------------
% 408.22/300.20 # User time : 0.002 s
% 408.22/300.20 # System time : 0.002 s
% 408.22/300.20 # Total time : 0.004 s
% 408.22/300.20 # Maximum resident set size: 1644 pages
% 408.22/300.20
% 408.22/300.20 # -------------------------------------------------
% 408.22/300.20 # User time : 0.002 s
% 408.22/300.20 # System time : 0.006 s
% 408.22/300.20 # Total time : 0.008 s
% 408.22/300.20 # Maximum resident set size: 1684 pages
% 408.22/300.20 % E---3.1 exiting
% 408.22/300.20 % E---3.1 exiting
%------------------------------------------------------------------------------