TSTP Solution File: LAT273-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT273-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:28 EDT 2024
% Result : Unsatisfiable 7.37s 1.40s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 11 unt; 4 nHn; 24 RR)
% Number of literals : 54 ( 0 equ; 29 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 : 41 ( 3 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/benchmark/Axioms/LAT006-2.ax',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_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/benchmark/Axioms/LAT006-2.ax',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_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/benchmark/Axioms/LAT006-2.ax',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_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/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_4,negated_conjecture,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.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/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_b,v_A,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_7,plain,
( 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)) ),
inference(fof_simplification,[status(thm)],[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,plain,
( 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) ),
inference(fof_simplification,[status(thm)],[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_9,plain,
( 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)) ),
inference(fof_simplification,[status(thm)],[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,plain,
( 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)) ),
c_0_7 ).
cnf(c_0_11,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_12,plain,
( 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) ),
c_0_8 ).
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(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).
cnf(c_0_15,plain,
( 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)) ),
c_0_9 ).
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_in(X1,v_S,t_a) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
c_in(v_b,v_A,t_a),
cls_conjecture_1 ).
cnf(c_0_18,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_19,negated_conjecture,
~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
c_0_14 ).
cnf(c_0_20,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_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,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_18,c_0_17]),c_0_19]) ).
cnf(c_0_22,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_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : LAT273-1 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 19:38:08 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.38 Running first-order model finding
% 0.14/0.39 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/benchmark/theBenchmark.p
% 7.37/1.40 # Version: 3.1.0
% 7.37/1.40 # Preprocessing class: FMLMSMSMSSSNFFN.
% 7.37/1.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.37/1.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.37/1.40 # Starting new_bool_3 with 300s (1) cores
% 7.37/1.40 # Starting new_bool_1 with 300s (1) cores
% 7.37/1.40 # Starting sh5l with 300s (1) cores
% 7.37/1.40 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23815 completed with status 0
% 7.37/1.40 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 7.37/1.40 # Preprocessing class: FMLMSMSMSSSNFFN.
% 7.37/1.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.37/1.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.37/1.40 # No SInE strategy applied
% 7.37/1.40 # Search class: FGHSM-SMLM33-DFFFFFNN
% 7.37/1.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 7.37/1.40 # Starting SAT001_MinMin_p005000_rr with 811s (1) cores
% 7.37/1.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 7.37/1.40 # Starting SAT001_CA_MinMin_p005000_rr with 136s (1) cores
% 7.37/1.40 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 7.37/1.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.37/1.40 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23823 completed with status 0
% 7.37/1.40 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 7.37/1.40 # Preprocessing class: FMLMSMSMSSSNFFN.
% 7.37/1.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.37/1.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.37/1.40 # No SInE strategy applied
% 7.37/1.40 # Search class: FGHSM-SMLM33-DFFFFFNN
% 7.37/1.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 7.37/1.40 # Starting SAT001_MinMin_p005000_rr with 811s (1) cores
% 7.37/1.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 7.37/1.40 # Preprocessing time : 0.018 s
% 7.37/1.40 # Presaturation interreduction done
% 7.37/1.40
% 7.37/1.40 # Proof found!
% 7.37/1.40 # SZS status Unsatisfiable
% 7.37/1.40 # SZS output start CNFRefutation
% See solution above
% 7.37/1.40 # Parsed axioms : 2758
% 7.37/1.40 # Removed by relevancy pruning/SinE : 0
% 7.37/1.40 # Initial clauses : 2758
% 7.37/1.40 # Removed in clause preprocessing : 9
% 7.37/1.40 # Initial clauses in saturation : 2749
% 7.37/1.40 # Processed clauses : 9231
% 7.37/1.40 # ...of these trivial : 53
% 7.37/1.40 # ...subsumed : 3468
% 7.37/1.40 # ...remaining for further processing : 5710
% 7.37/1.40 # Other redundant clauses eliminated : 161
% 7.37/1.40 # Clauses deleted for lack of memory : 0
% 7.37/1.40 # Backward-subsumed : 58
% 7.37/1.40 # Backward-rewritten : 70
% 7.37/1.40 # Generated clauses : 24367
% 7.37/1.40 # ...of the previous two non-redundant : 20854
% 7.37/1.40 # ...aggressively subsumed : 0
% 7.37/1.40 # Contextual simplify-reflections : 10
% 7.37/1.40 # Paramodulations : 24158
% 7.37/1.40 # Factorizations : 1
% 7.37/1.40 # NegExts : 0
% 7.37/1.40 # Equation resolutions : 208
% 7.37/1.40 # Disequality decompositions : 0
% 7.37/1.40 # Total rewrite steps : 11228
% 7.37/1.40 # ...of those cached : 9712
% 7.37/1.40 # Propositional unsat checks : 1
% 7.37/1.40 # Propositional check models : 1
% 7.37/1.40 # Propositional check unsatisfiable : 0
% 7.37/1.40 # Propositional clauses : 0
% 7.37/1.40 # Propositional clauses after purity: 0
% 7.37/1.40 # Propositional unsat core size : 0
% 7.37/1.40 # Propositional preprocessing time : 0.000
% 7.37/1.40 # Propositional encoding time : 0.012
% 7.37/1.40 # Propositional solver time : 0.011
% 7.37/1.40 # Success case prop preproc time : 0.000
% 7.37/1.40 # Success case prop encoding time : 0.000
% 7.37/1.40 # Success case prop solver time : 0.000
% 7.37/1.40 # Current number of processed clauses : 2959
% 7.37/1.40 # Positive orientable unit clauses : 628
% 7.37/1.40 # Positive unorientable unit clauses: 8
% 7.37/1.40 # Negative unit clauses : 98
% 7.37/1.40 # Non-unit-clauses : 2225
% 7.37/1.40 # Current number of unprocessed clauses: 16941
% 7.37/1.40 # ...number of literals in the above : 61324
% 7.37/1.40 # Current number of archived formulas : 0
% 7.37/1.40 # Current number of archived clauses : 2759
% 7.37/1.40 # Clause-clause subsumption calls (NU) : 4360820
% 7.37/1.40 # Rec. Clause-clause subsumption calls : 2791503
% 7.37/1.40 # Non-unit clause-clause subsumptions : 3035
% 7.37/1.40 # Unit Clause-clause subsumption calls : 172135
% 7.37/1.40 # Rewrite failures with RHS unbound : 0
% 7.37/1.40 # BW rewrite match attempts : 917
% 7.37/1.40 # BW rewrite match successes : 49
% 7.37/1.40 # Condensation attempts : 0
% 7.37/1.40 # Condensation successes : 0
% 7.37/1.40 # Termbank termtop insertions : 559146
% 7.37/1.40 # Search garbage collected termcells : 4032
% 7.37/1.40
% 7.37/1.40 # -------------------------------------------------
% 7.37/1.40 # User time : 0.933 s
% 7.37/1.40 # System time : 0.025 s
% 7.37/1.40 # Total time : 0.958 s
% 7.37/1.40 # Maximum resident set size: 6744 pages
% 7.37/1.40
% 7.37/1.40 # -------------------------------------------------
% 7.37/1.40 # User time : 4.478 s
% 7.37/1.40 # System time : 0.093 s
% 7.37/1.40 # Total time : 4.571 s
% 7.37/1.40 # Maximum resident set size: 3484 pages
% 7.37/1.40 % E---3.1 exiting
%------------------------------------------------------------------------------