TSTP Solution File: LAT273-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT273-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:14 EDT 2023
% Result : Unsatisfiable 12.41s 2.51s
% Output : CNFRefutation 12.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 10 unt; 3 nHn; 20 RR)
% Number of literals : 42 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-4 aty)
% Number of variables : 29 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0,axiom,
( c_in(c_Pair(X1,X6,X3,X3),X4,tc_prod(X3,X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,c_Tarski_Ointerval(X4,X5,X6,X3),tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kz1M5HeeIe/E---3.1_32082.p',cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file('/export/starexec/sandbox/tmp/tmp.kz1M5HeeIe/E---3.1_32082.p',cls_conjecture_2) ).
cnf(cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0,axiom,
( c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(v_sko__4mi(X1,v_r,X3),X1,t_a)
| ~ c_Tarski_OisLub(X1,v_cl,X2,t_a)
| ~ c_in(X3,v_A,t_a) ),
file('/export/starexec/sandbox/tmp/tmp.kz1M5HeeIe/E---3.1_32082.p',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0) ).
cnf(cls_conjecture_4,negated_conjecture,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
file('/export/starexec/sandbox/tmp/tmp.kz1M5HeeIe/E---3.1_32082.p',cls_conjecture_4) ).
cnf(cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1,axiom,
( c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_Tarski_OisLub(X1,v_cl,X2,t_a)
| ~ c_in(X3,v_A,t_a)
| ~ c_in(c_Pair(v_sko__4mi(X1,v_r,X3),X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.kz1M5HeeIe/E---3.1_32082.p',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_b,v_A,t_a),
file('/export/starexec/sandbox/tmp/tmp.kz1M5HeeIe/E---3.1_32082.p',cls_conjecture_1) ).
cnf(cls_conjecture_6,negated_conjecture,
~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox/tmp/tmp.kz1M5HeeIe/E---3.1_32082.p',cls_conjecture_6) ).
cnf(c_0_7,axiom,
( c_in(c_Pair(X1,X6,X3,X3),X4,tc_prod(X3,X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,c_Tarski_Ointerval(X4,X5,X6,X3),tc_set(X3)) ),
cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0 ).
cnf(c_0_8,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
cls_conjecture_2 ).
cnf(c_0_9,axiom,
( c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(v_sko__4mi(X1,v_r,X3),X1,t_a)
| ~ c_Tarski_OisLub(X1,v_cl,X2,t_a)
| ~ c_in(X3,v_A,t_a) ),
cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0 ).
cnf(c_0_10,negated_conjecture,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
cls_conjecture_4 ).
cnf(c_0_11,axiom,
( c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_Tarski_OisLub(X1,v_cl,X2,t_a)
| ~ c_in(X3,v_A,t_a)
| ~ c_in(c_Pair(v_sko__4mi(X1,v_r,X3),X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1 ).
cnf(c_0_12,negated_conjecture,
( c_in(c_Pair(X1,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(X1,v_S,t_a) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
c_in(v_b,v_A,t_a),
cls_conjecture_1 ).
cnf(c_0_14,negated_conjecture,
( c_in(c_Pair(v_L,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(v_sko__4mi(v_S,v_r,X1),v_S,t_a)
| ~ c_in(X1,v_A,t_a) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
cls_conjecture_6 ).
cnf(c_0_16,negated_conjecture,
( c_in(c_Pair(X1,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_Tarski_OisLub(X2,v_cl,X1,t_a)
| ~ c_in(v_sko__4mi(X2,v_r,v_b),v_S,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_17,negated_conjecture,
c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( c_in(c_Pair(X1,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_Tarski_OisLub(v_S,v_cl,X1,t_a) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_10]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.31 % Problem : LAT273-1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.32 % Command : run_E %s %d THM
% 0.31/0.52 % Computer : n024.cluster.edu
% 0.31/0.52 % Model : x86_64 x86_64
% 0.31/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.31/0.52 % Memory : 8042.1875MB
% 0.31/0.52 % OS : Linux 3.10.0-693.el7.x86_64
% 0.31/0.52 % CPULimit : 2400
% 0.31/0.52 % WCLimit : 300
% 0.31/0.52 % DateTime : Mon Oct 2 10:01:57 EDT 2023
% 0.31/0.52 % CPUTime :
% 0.65/0.92 Running first-order theorem proving
% 0.65/0.92 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/tmp/tmp.kz1M5HeeIe/E---3.1_32082.p
% 12.41/2.51 # Version: 3.1pre001
% 12.41/2.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 12.41/2.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.41/2.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.41/2.51 # Starting new_bool_3 with 300s (1) cores
% 12.41/2.51 # Starting new_bool_1 with 300s (1) cores
% 12.41/2.51 # Starting sh5l with 300s (1) cores
% 12.41/2.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32162 completed with status 0
% 12.41/2.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 12.41/2.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 12.41/2.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.41/2.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.41/2.51 # No SInE strategy applied
% 12.41/2.51 # Search class: FGHSM-SMLM33-DFFFFFNN
% 12.41/2.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 12.41/2.51 # Starting SAT001_MinMin_p005000_rr with 811s (1) cores
% 12.41/2.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.41/2.51 # Starting SAT001_CA_MinMin_p005000_rr with 136s (1) cores
% 12.41/2.51 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 12.41/2.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 12.41/2.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32170 completed with status 0
% 12.41/2.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 12.41/2.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 12.41/2.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.41/2.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.41/2.51 # No SInE strategy applied
% 12.41/2.51 # Search class: FGHSM-SMLM33-DFFFFFNN
% 12.41/2.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 12.41/2.51 # Starting SAT001_MinMin_p005000_rr with 811s (1) cores
% 12.41/2.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.41/2.51 # Preprocessing time : 0.025 s
% 12.41/2.51 # Presaturation interreduction done
% 12.41/2.51
% 12.41/2.51 # Proof found!
% 12.41/2.51 # SZS status Unsatisfiable
% 12.41/2.51 # SZS output start CNFRefutation
% See solution above
% 12.41/2.51 # Parsed axioms : 2758
% 12.41/2.51 # Removed by relevancy pruning/SinE : 0
% 12.41/2.51 # Initial clauses : 2758
% 12.41/2.51 # Removed in clause preprocessing : 9
% 12.41/2.51 # Initial clauses in saturation : 2749
% 12.41/2.51 # Processed clauses : 9231
% 12.41/2.51 # ...of these trivial : 53
% 12.41/2.51 # ...subsumed : 3468
% 12.41/2.51 # ...remaining for further processing : 5710
% 12.41/2.51 # Other redundant clauses eliminated : 161
% 12.41/2.51 # Clauses deleted for lack of memory : 0
% 12.41/2.51 # Backward-subsumed : 58
% 12.41/2.51 # Backward-rewritten : 70
% 12.41/2.51 # Generated clauses : 24367
% 12.41/2.51 # ...of the previous two non-redundant : 20854
% 12.41/2.51 # ...aggressively subsumed : 0
% 12.41/2.51 # Contextual simplify-reflections : 10
% 12.41/2.51 # Paramodulations : 24158
% 12.41/2.51 # Factorizations : 1
% 12.41/2.51 # NegExts : 0
% 12.41/2.51 # Equation resolutions : 208
% 12.41/2.51 # Total rewrite steps : 11228
% 12.41/2.51 # Propositional unsat checks : 1
% 12.41/2.51 # Propositional check models : 1
% 12.41/2.51 # Propositional check unsatisfiable : 0
% 12.41/2.51 # Propositional clauses : 0
% 12.41/2.51 # Propositional clauses after purity: 0
% 12.41/2.51 # Propositional unsat core size : 0
% 12.41/2.51 # Propositional preprocessing time : 0.000
% 12.41/2.51 # Propositional encoding time : 0.019
% 12.41/2.51 # Propositional solver time : 0.017
% 12.41/2.51 # Success case prop preproc time : 0.000
% 12.41/2.51 # Success case prop encoding time : 0.000
% 12.41/2.51 # Success case prop solver time : 0.000
% 12.41/2.51 # Current number of processed clauses : 2959
% 12.41/2.51 # Positive orientable unit clauses : 628
% 12.41/2.51 # Positive unorientable unit clauses: 8
% 12.41/2.51 # Negative unit clauses : 98
% 12.41/2.51 # Non-unit-clauses : 2225
% 12.41/2.51 # Current number of unprocessed clauses: 16941
% 12.41/2.51 # ...number of literals in the above : 61324
% 12.41/2.51 # Current number of archived formulas : 0
% 12.41/2.51 # Current number of archived clauses : 2759
% 12.41/2.51 # Clause-clause subsumption calls (NU) : 4360827
% 12.41/2.51 # Rec. Clause-clause subsumption calls : 2791510
% 12.41/2.51 # Non-unit clause-clause subsumptions : 3035
% 12.41/2.51 # Unit Clause-clause subsumption calls : 172135
% 12.41/2.51 # Rewrite failures with RHS unbound : 0
% 12.41/2.51 # BW rewrite match attempts : 917
% 12.41/2.51 # BW rewrite match successes : 49
% 12.41/2.51 # Condensation attempts : 0
% 12.41/2.51 # Condensation successes : 0
% 12.41/2.51 # Termbank termtop insertions : 543800
% 12.41/2.51
% 12.41/2.51 # -------------------------------------------------
% 12.41/2.51 # User time : 1.456 s
% 12.41/2.51 # System time : 0.043 s
% 12.41/2.51 # Total time : 1.500 s
% 12.41/2.51 # Maximum resident set size: 6376 pages
% 12.41/2.51
% 12.41/2.51 # -------------------------------------------------
% 12.41/2.51 # User time : 7.044 s
% 12.41/2.51 # System time : 0.156 s
% 12.41/2.51 # Total time : 7.200 s
% 12.41/2.51 # Maximum resident set size: 3500 pages
% 12.41/2.51 % E---3.1 exiting
% 12.41/2.51 % E---3.1 exiting
%------------------------------------------------------------------------------