TSTP Solution File: LAT273-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n012.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:18 EDT 2023
% Result : Unsatisfiable 12.86s 2.34s
% Output : CNFRefutation 12.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 9 unt; 3 nHn; 19 RR)
% Number of literals : 41 ( 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/sandbox2/tmp/tmp.KDDPxBODML/E---3.1_18507.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/sandbox2/tmp/tmp.KDDPxBODML/E---3.1_18507.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_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/sandbox2/tmp/tmp.KDDPxBODML/E---3.1_18507.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/sandbox2/tmp/tmp.KDDPxBODML/E---3.1_18507.p',cls_conjecture_1) ).
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/sandbox2/tmp/tmp.KDDPxBODML/E---3.1_18507.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/sandbox2/tmp/tmp.KDDPxBODML/E---3.1_18507.p',cls_conjecture_4) ).
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/sandbox2/tmp/tmp.KDDPxBODML/E---3.1_18507.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_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_10,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_11,negated_conjecture,
c_in(v_b,v_A,t_a),
cls_conjecture_1 ).
cnf(c_0_12,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_13,negated_conjecture,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
cls_conjecture_4 ).
cnf(c_0_14,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_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,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_12,c_0_13]) ).
cnf(c_0_16,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_17,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(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11])]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LAT273-1 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n012.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 10:20:50 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.62 Running first-order model finding
% 0.16/0.62 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.KDDPxBODML/E---3.1_18507.p
% 12.86/2.34 # Version: 3.1pre001
% 12.86/2.34 # Preprocessing class: FMLMSMSMSSSNFFN.
% 12.86/2.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.86/2.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.86/2.34 # Starting new_bool_3 with 300s (1) cores
% 12.86/2.34 # Starting new_bool_1 with 300s (1) cores
% 12.86/2.34 # Starting sh5l with 300s (1) cores
% 12.86/2.34 # sh5l with pid 18594 completed with status 0
% 12.86/2.34 # Result found by sh5l
% 12.86/2.34 # Preprocessing class: FMLMSMSMSSSNFFN.
% 12.86/2.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.86/2.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.86/2.34 # Starting new_bool_3 with 300s (1) cores
% 12.86/2.34 # Starting new_bool_1 with 300s (1) cores
% 12.86/2.34 # Starting sh5l with 300s (1) cores
% 12.86/2.34 # SinE strategy is gf500_gu_R04_F100_L20000
% 12.86/2.34 # Search class: FGHSM-SMLM32-DFFFFFNN
% 12.86/2.34 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 12.86/2.34 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 12.86/2.34 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 18597 completed with status 0
% 12.86/2.34 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 12.86/2.34 # Preprocessing class: FMLMSMSMSSSNFFN.
% 12.86/2.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.86/2.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.86/2.34 # Starting new_bool_3 with 300s (1) cores
% 12.86/2.34 # Starting new_bool_1 with 300s (1) cores
% 12.86/2.34 # Starting sh5l with 300s (1) cores
% 12.86/2.34 # SinE strategy is gf500_gu_R04_F100_L20000
% 12.86/2.34 # Search class: FGHSM-SMLM32-DFFFFFNN
% 12.86/2.34 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 12.86/2.34 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 12.86/2.34 # Preprocessing time : 0.023 s
% 12.86/2.34 # Presaturation interreduction done
% 12.86/2.34
% 12.86/2.34 # Proof found!
% 12.86/2.34 # SZS status Unsatisfiable
% 12.86/2.34 # SZS output start CNFRefutation
% See solution above
% 12.86/2.34 # Parsed axioms : 2758
% 12.86/2.34 # Removed by relevancy pruning/SinE : 238
% 12.86/2.34 # Initial clauses : 2520
% 12.86/2.34 # Removed in clause preprocessing : 1
% 12.86/2.34 # Initial clauses in saturation : 2519
% 12.86/2.34 # Processed clauses : 11145
% 12.86/2.34 # ...of these trivial : 60
% 12.86/2.34 # ...subsumed : 5437
% 12.86/2.34 # ...remaining for further processing : 5648
% 12.86/2.34 # Other redundant clauses eliminated : 149
% 12.86/2.34 # Clauses deleted for lack of memory : 0
% 12.86/2.34 # Backward-subsumed : 67
% 12.86/2.34 # Backward-rewritten : 206
% 12.86/2.34 # Generated clauses : 27878
% 12.86/2.34 # ...of the previous two non-redundant : 24185
% 12.86/2.34 # ...aggressively subsumed : 0
% 12.86/2.34 # Contextual simplify-reflections : 15
% 12.86/2.34 # Paramodulations : 27691
% 12.86/2.34 # Factorizations : 3
% 12.86/2.34 # NegExts : 0
% 12.86/2.34 # Equation resolutions : 184
% 12.86/2.34 # Total rewrite steps : 13306
% 12.86/2.34 # Propositional unsat checks : 1
% 12.86/2.34 # Propositional check models : 1
% 12.86/2.34 # Propositional check unsatisfiable : 0
% 12.86/2.34 # Propositional clauses : 0
% 12.86/2.34 # Propositional clauses after purity: 0
% 12.86/2.34 # Propositional unsat core size : 0
% 12.86/2.34 # Propositional preprocessing time : 0.000
% 12.86/2.34 # Propositional encoding time : 0.036
% 12.86/2.34 # Propositional solver time : 0.024
% 12.86/2.34 # Success case prop preproc time : 0.000
% 12.86/2.34 # Success case prop encoding time : 0.000
% 12.86/2.34 # Success case prop solver time : 0.000
% 12.86/2.34 # Current number of processed clauses : 2960
% 12.86/2.34 # Positive orientable unit clauses : 489
% 12.86/2.34 # Positive unorientable unit clauses: 7
% 12.86/2.34 # Negative unit clauses : 149
% 12.86/2.34 # Non-unit-clauses : 2315
% 12.86/2.34 # Current number of unprocessed clauses: 17914
% 12.86/2.34 # ...number of literals in the above : 65488
% 12.86/2.34 # Current number of archived formulas : 0
% 12.86/2.34 # Current number of archived clauses : 2688
% 12.86/2.34 # Clause-clause subsumption calls (NU) : 4734862
% 12.86/2.34 # Rec. Clause-clause subsumption calls : 3137614
% 12.86/2.34 # Non-unit clause-clause subsumptions : 3752
% 12.86/2.34 # Unit Clause-clause subsumption calls : 135134
% 12.86/2.34 # Rewrite failures with RHS unbound : 0
% 12.86/2.34 # BW rewrite match attempts : 863
% 12.86/2.34 # BW rewrite match successes : 58
% 12.86/2.34 # Condensation attempts : 0
% 12.86/2.34 # Condensation successes : 0
% 12.86/2.34 # Termbank termtop insertions : 627586
% 12.86/2.34
% 12.86/2.34 # -------------------------------------------------
% 12.86/2.34 # User time : 1.584 s
% 12.86/2.34 # System time : 0.035 s
% 12.86/2.34 # Total time : 1.619 s
% 12.86/2.34 # Maximum resident set size: 6696 pages
% 12.86/2.34
% 12.86/2.34 # -------------------------------------------------
% 12.86/2.34 # User time : 1.632 s
% 12.86/2.34 # System time : 0.040 s
% 12.86/2.34 # Total time : 1.671 s
% 12.86/2.34 # Maximum resident set size: 3500 pages
% 12.86/2.34 % E---3.1 exiting
%------------------------------------------------------------------------------