TSTP Solution File: HEN008-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : HEN008-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : Sat May 4 08:02:43 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 41 ( 18 unt; 0 nHn; 36 RR)
% Number of literals : 89 ( 10 equ; 52 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 82 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_property,axiom,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',quotient_property) ).
cnf(quotient_less_equal,axiom,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',quotient_less_equal) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',closure) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',zero_is_smallest) ).
cnf(aLEb,hypothesis,
less_equal(a,b),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',aLEb) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',less_equal_and_equal) ).
cnf(less_equal_quotient,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',less_equal_quotient) ).
cnf(bQc,hypothesis,
quotient(b,c,bQc),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',bQc) ).
cnf(well_defined,axiom,
( X3 = X4
| ~ quotient(X1,X2,X3)
| ~ quotient(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',well_defined) ).
cnf(aQc,hypothesis,
quotient(a,c,aQc),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',aQc) ).
cnf(prove_aQcLEbQc,negated_conjecture,
~ less_equal(aQc,bQc),
file('/export/starexec/sandbox2/tmp/tmp.XiBklrpNCs/E---3.1_24277.p',prove_aQcLEbQc) ).
cnf(c_0_11,plain,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
inference(fof_simplification,[status(thm)],[quotient_property]) ).
cnf(c_0_12,plain,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal]) ).
cnf(c_0_13,plain,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
c_0_11 ).
cnf(c_0_14,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_15,plain,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
c_0_12 ).
cnf(c_0_16,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_17,plain,
( less_equal(divide(X1,X2),X3)
| ~ quotient(X4,X5,X3)
| ~ quotient(X6,X5,X2)
| ~ quotient(X7,X5,X1)
| ~ quotient(X7,X6,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
quotient(zero,X1,zero),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,hypothesis,
less_equal(a,b),
aLEb ).
cnf(c_0_20,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_21,plain,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
inference(fof_simplification,[status(thm)],[less_equal_quotient]) ).
cnf(c_0_22,plain,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,X4,zero)
| ~ quotient(X4,X5,X2)
| ~ quotient(X3,X5,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,hypothesis,
quotient(a,b,zero),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_24,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
c_0_20 ).
cnf(c_0_25,plain,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
c_0_21 ).
cnf(c_0_26,hypothesis,
( less_equal(divide(X1,X2),zero)
| ~ quotient(b,X3,X2)
| ~ quotient(a,X3,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,hypothesis,
quotient(b,c,bQc),
bQc ).
cnf(c_0_28,plain,
( X3 = X4
| ~ quotient(X1,X2,X3)
| ~ quotient(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[well_defined]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ quotient(X2,X1,zero)
| ~ less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,hypothesis,
( less_equal(divide(X1,bQc),zero)
| ~ quotient(a,c,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( X3 = X4
| ~ quotient(X1,X2,X3)
| ~ quotient(X1,X2,X4) ),
c_0_28 ).
cnf(c_0_32,hypothesis,
quotient(a,c,aQc),
aQc ).
cnf(c_0_33,negated_conjecture,
~ less_equal(aQc,bQc),
inference(fof_simplification,[status(thm)],[prove_aQcLEbQc]) ).
cnf(c_0_34,hypothesis,
( divide(X1,bQc) = zero
| ~ quotient(a,c,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18])]) ).
cnf(c_0_35,hypothesis,
( X1 = aQc
| ~ quotient(a,c,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
~ less_equal(aQc,bQc),
c_0_33 ).
cnf(c_0_37,hypothesis,
( quotient(X1,bQc,zero)
| ~ quotient(a,c,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_34]) ).
cnf(c_0_38,hypothesis,
divide(a,c) = aQc,
inference(spm,[status(thm)],[c_0_35,c_0_14]) ).
cnf(c_0_39,negated_conjecture,
~ quotient(aQc,bQc,zero),
inference(spm,[status(thm)],[c_0_36,c_0_25]) ).
cnf(c_0_40,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_14]),c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : HEN008-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n014.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 : Fri May 3 08:31:02 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.XiBklrpNCs/E---3.1_24277.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24407 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FHUSS-FFSS22-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24412 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FHUSS-FFSS22-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 13
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 13
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 13
% 0.20/0.51 # Processed clauses : 174
% 0.20/0.51 # ...of these trivial : 1
% 0.20/0.51 # ...subsumed : 62
% 0.20/0.51 # ...remaining for further processing : 111
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 1
% 0.20/0.51 # Backward-rewritten : 1
% 0.20/0.51 # Generated clauses : 334
% 0.20/0.51 # ...of the previous two non-redundant : 211
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 334
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 158
% 0.20/0.51 # ...of those cached : 102
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 96
% 0.20/0.51 # Positive orientable unit clauses : 25
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 2
% 0.20/0.51 # Non-unit-clauses : 69
% 0.20/0.51 # Current number of unprocessed clauses: 61
% 0.20/0.51 # ...number of literals in the above : 192
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 15
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 1295
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 1107
% 0.20/0.51 # Non-unit clause-clause subsumptions : 63
% 0.20/0.51 # Unit Clause-clause subsumption calls : 1
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 9
% 0.20/0.51 # BW rewrite match successes : 1
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 4072
% 0.20/0.51 # Search garbage collected termcells : 30
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.014 s
% 0.20/0.51 # System time : 0.000 s
% 0.20/0.51 # Total time : 0.014 s
% 0.20/0.51 # Maximum resident set size: 1640 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.056 s
% 0.20/0.51 # System time : 0.008 s
% 0.20/0.51 # Total time : 0.064 s
% 0.20/0.51 # Maximum resident set size: 1692 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------