TSTP Solution File: MGT044-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : MGT044-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : Tue May 21 00:41:03 EDT 2024
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 11 unt; 0 nHn; 20 RR)
% Number of literals : 49 ( 7 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assumption_9_36,axiom,
( internal_friction(X1,X2) = internal_friction(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_9_36) ).
cnf(assumption_5_32,axiom,
( greater(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_5_32) ).
cnf(lemma_3_37,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3_37) ).
cnf(definition_smaller_or_equal_3,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_3) ).
cnf(assumption_7_35,axiom,
( greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_7_35) ).
cnf(lemma_3_39,negated_conjecture,
~ greater(capability(sk1,sk3),capability(sk1,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3_39) ).
cnf(lemma_3_38,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3_38) ).
cnf(c_0_7,plain,
( internal_friction(X1,X2) = internal_friction(X1,X3)
| ~ organization(X1) ),
inference(fof_simplification,[status(thm)],[assumption_9_36]) ).
cnf(c_0_8,plain,
( greater(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_5_32]) ).
cnf(c_0_9,plain,
( internal_friction(X1,X2) = internal_friction(X1,X3)
| ~ organization(X1) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
organization(sk1),
lemma_3_37 ).
cnf(c_0_11,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_3]) ).
cnf(c_0_12,plain,
( greater(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
internal_friction(sk1,X1) = internal_friction(sk1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
c_0_11 ).
cnf(c_0_15,plain,
( greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_7_35]) ).
cnf(c_0_16,negated_conjecture,
~ greater(capability(sk1,sk3),capability(sk1,sk2)),
inference(fof_simplification,[status(thm)],[lemma_3_39]) ).
cnf(c_0_17,negated_conjecture,
( greater(capability(sk1,X1),capability(sk1,X2))
| ~ greater(stock_of_knowledge(sk1,X1),stock_of_knowledge(sk1,X2))
| ~ smaller_or_equal(internal_friction(sk1,X3),internal_friction(sk1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10])]) ).
cnf(c_0_18,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
lemma_3_38 ).
cnf(c_0_21,negated_conjecture,
~ greater(capability(sk1,sk3),capability(sk1,sk2)),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( greater(capability(sk1,X1),capability(sk1,X2))
| ~ greater(stock_of_knowledge(sk1,X1),stock_of_knowledge(sk1,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MGT044-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 00:07:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # new_bool_1 with pid 17778 completed with status 0
% 0.20/0.48 # Result found by new_bool_1
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # SAT001_MinMin_p005000_rr_RG with pid 17783 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 19
% 0.20/0.48 # Removed by relevancy pruning/SinE : 3
% 0.20/0.48 # Initial clauses : 16
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 16
% 0.20/0.48 # Processed clauses : 84
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 20
% 0.20/0.48 # ...remaining for further processing : 64
% 0.20/0.48 # Other redundant clauses eliminated : 1
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 3
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 130
% 0.20/0.48 # ...of the previous two non-redundant : 106
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 2
% 0.20/0.48 # Paramodulations : 126
% 0.20/0.48 # Factorizations : 2
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 2
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 29
% 0.20/0.48 # ...of those cached : 26
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 44
% 0.20/0.48 # Positive orientable unit clauses : 4
% 0.20/0.48 # Positive unorientable unit clauses: 1
% 0.20/0.48 # Negative unit clauses : 3
% 0.20/0.48 # Non-unit-clauses : 36
% 0.20/0.48 # Current number of unprocessed clauses: 49
% 0.20/0.48 # ...number of literals in the above : 195
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 19
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 653
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 531
% 0.20/0.48 # Non-unit clause-clause subsumptions : 18
% 0.20/0.48 # Unit Clause-clause subsumption calls : 1
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 0
% 0.20/0.48 # BW rewrite match successes : 0
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 2752
% 0.20/0.48 # Search garbage collected termcells : 50
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.006 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.008 s
% 0.20/0.48 # Maximum resident set size: 1596 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.008 s
% 0.20/0.48 # System time : 0.004 s
% 0.20/0.48 # Total time : 0.012 s
% 0.20/0.48 # Maximum resident set size: 1712 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------