TSTP Solution File: MGT006-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT006-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:35:57 EDT 2023
% Result : Timeout 0.38s 300.12s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 45 ( 19 unt; 0 nHn; 45 RR)
% Number of literals : 160 ( 0 equ; 118 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 117 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a2_FOL_3,hypothesis,
( greater(X8,X7)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reliability(X1,X5,X2)
| ~ reliability(X3,X6,X4)
| ~ accountability(X1,X7,X2)
| ~ accountability(X3,X8,X4)
| ~ reproducibility(X1,X9,X2)
| ~ reproducibility(X3,X10,X4)
| ~ greater(X10,X9) ),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',a2_FOL_3) ).
cnf(t6_FOL_12,negated_conjecture,
accountability(sk2,sk6,sk8),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',t6_FOL_12) ).
cnf(t6_FOL_7,negated_conjecture,
organization(sk2,sk8),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',t6_FOL_7) ).
cnf(t6_FOL_10,negated_conjecture,
reliability(sk2,sk4,sk8),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',t6_FOL_10) ).
cnf(a4_FOL_5,hypothesis,
( greater(X5,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ reproducibility(X1,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ greater(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',a4_FOL_5) ).
cnf(t6_FOL_8,negated_conjecture,
reorganization_free(sk2,sk7,sk8),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',t6_FOL_8) ).
cnf(t6_FOL_13,negated_conjecture,
greater(sk8,sk7),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',t6_FOL_13) ).
cnf(t6_FOL_6,negated_conjecture,
organization(sk2,sk7),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',t6_FOL_6) ).
cnf(a2_FOL_2,hypothesis,
( greater(X6,X5)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reliability(X1,X5,X2)
| ~ reliability(X3,X6,X4)
| ~ accountability(X1,X7,X2)
| ~ accountability(X3,X8,X4)
| ~ reproducibility(X1,X9,X2)
| ~ reproducibility(X3,X10,X4)
| ~ greater(X10,X9) ),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',a2_FOL_2) ).
cnf(mp3_1,axiom,
( reproducibility(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',mp3_1) ).
cnf(t6_FOL_11,negated_conjecture,
accountability(sk2,sk5,sk7),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',t6_FOL_11) ).
cnf(t6_FOL_9,negated_conjecture,
reliability(sk2,sk3,sk7),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',t6_FOL_9) ).
cnf(t6_FOL_14,negated_conjecture,
( ~ greater(sk4,sk3)
| ~ greater(sk6,sk5) ),
file('/export/starexec/sandbox/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p',t6_FOL_14) ).
cnf(c_0_13,hypothesis,
( greater(X8,X7)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reliability(X1,X5,X2)
| ~ reliability(X3,X6,X4)
| ~ accountability(X1,X7,X2)
| ~ accountability(X3,X8,X4)
| ~ reproducibility(X1,X9,X2)
| ~ reproducibility(X3,X10,X4)
| ~ greater(X10,X9) ),
a2_FOL_3 ).
cnf(c_0_14,negated_conjecture,
accountability(sk2,sk6,sk8),
t6_FOL_12 ).
cnf(c_0_15,negated_conjecture,
organization(sk2,sk8),
t6_FOL_7 ).
cnf(c_0_16,negated_conjecture,
( greater(sk6,X1)
| ~ greater(X2,X3)
| ~ accountability(X4,X1,X5)
| ~ reliability(sk2,X6,sk8)
| ~ reliability(X4,X7,X5)
| ~ reproducibility(sk2,X2,sk8)
| ~ reproducibility(X4,X3,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_17,negated_conjecture,
reliability(sk2,sk4,sk8),
t6_FOL_10 ).
cnf(c_0_18,hypothesis,
( greater(X5,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ reproducibility(X1,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ greater(X3,X2) ),
a4_FOL_5 ).
cnf(c_0_19,negated_conjecture,
reorganization_free(sk2,sk7,sk8),
t6_FOL_8 ).
cnf(c_0_20,negated_conjecture,
greater(sk8,sk7),
t6_FOL_13 ).
cnf(c_0_21,negated_conjecture,
organization(sk2,sk7),
t6_FOL_6 ).
cnf(c_0_22,hypothesis,
( greater(X6,X5)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reliability(X1,X5,X2)
| ~ reliability(X3,X6,X4)
| ~ accountability(X1,X7,X2)
| ~ accountability(X3,X8,X4)
| ~ reproducibility(X1,X9,X2)
| ~ reproducibility(X3,X10,X4)
| ~ greater(X10,X9) ),
a2_FOL_2 ).
cnf(c_0_23,negated_conjecture,
( greater(sk6,X1)
| ~ greater(X2,X3)
| ~ accountability(X4,X1,X5)
| ~ reliability(X4,X6,X5)
| ~ reproducibility(sk2,X2,sk8)
| ~ reproducibility(X4,X3,X5)
| ~ organization(X4,X5) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,axiom,
( reproducibility(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
mp3_1 ).
cnf(c_0_25,negated_conjecture,
( greater(X1,X2)
| ~ reproducibility(sk2,X1,sk8)
| ~ reproducibility(sk2,X2,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_15]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ accountability(X5,X6,X7)
| ~ reliability(sk2,X1,sk8)
| ~ reliability(X5,X2,X7)
| ~ reproducibility(sk2,X3,sk8)
| ~ reproducibility(X5,X4,X7)
| ~ organization(X5,X7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_14]),c_0_15])]) ).
cnf(c_0_27,negated_conjecture,
( greater(sk6,X1)
| ~ greater(sk1(sk8,sk2),X2)
| ~ accountability(X3,X1,X4)
| ~ reliability(X3,X5,X4)
| ~ reproducibility(X3,X2,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15])]) ).
cnf(c_0_28,negated_conjecture,
( greater(sk1(sk8,sk2),X1)
| ~ reproducibility(sk2,X1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_15])]) ).
cnf(c_0_29,negated_conjecture,
( greater(sk4,X1)
| ~ greater(X2,X3)
| ~ accountability(X4,X5,X6)
| ~ reliability(X4,X1,X6)
| ~ reproducibility(sk2,X2,sk8)
| ~ reproducibility(X4,X3,X6)
| ~ organization(X4,X6) ),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_30,negated_conjecture,
( greater(sk6,X1)
| ~ accountability(X2,X1,X3)
| ~ reliability(X2,X4,X3)
| ~ reproducibility(sk2,X5,sk7)
| ~ reproducibility(X2,X5,X3)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( greater(sk4,X1)
| ~ greater(sk1(sk8,sk2),X2)
| ~ accountability(X3,X4,X5)
| ~ reliability(X3,X1,X5)
| ~ reproducibility(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_24]),c_0_15])]) ).
cnf(c_0_32,negated_conjecture,
( greater(sk6,X1)
| ~ accountability(X2,X1,X3)
| ~ reliability(X2,X4,X3)
| ~ reproducibility(X2,sk1(sk7,sk2),X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_24]),c_0_21])]) ).
cnf(c_0_33,negated_conjecture,
( greater(sk4,X1)
| ~ accountability(X2,X3,X4)
| ~ reliability(X2,X1,X4)
| ~ reproducibility(sk2,X5,sk7)
| ~ reproducibility(X2,X5,X4)
| ~ organization(X2,X4) ),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( greater(sk6,X1)
| ~ accountability(sk2,X1,sk7)
| ~ reliability(sk2,X2,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_21])]) ).
cnf(c_0_35,negated_conjecture,
accountability(sk2,sk5,sk7),
t6_FOL_11 ).
cnf(c_0_36,negated_conjecture,
( greater(sk4,X1)
| ~ accountability(X2,X3,X4)
| ~ reliability(X2,X1,X4)
| ~ reproducibility(X2,sk1(sk7,sk2),X4)
| ~ organization(X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_21])]) ).
cnf(c_0_37,negated_conjecture,
( greater(sk6,sk5)
| ~ reliability(sk2,X1,sk7) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
reliability(sk2,sk3,sk7),
t6_FOL_9 ).
cnf(c_0_39,negated_conjecture,
( greater(sk4,X1)
| ~ accountability(sk2,X2,sk7)
| ~ reliability(sk2,X1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_21])]) ).
cnf(c_0_40,negated_conjecture,
( ~ greater(sk4,sk3)
| ~ greater(sk6,sk5) ),
t6_FOL_14 ).
cnf(c_0_41,negated_conjecture,
greater(sk6,sk5),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( greater(sk4,X1)
| ~ reliability(sk2,X1,sk7) ),
inference(spm,[status(thm)],[c_0_39,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
~ greater(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_38]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT006-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 00:19:30 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.47 Running first-order model finding
% 0.22/0.47 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/tmp/tmp.JUvN2aBL4W/E---3.1_32120.p
% 0.38/300.12 # Version: 3.1pre001
% 0.38/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/300.12 # Starting new_bool_3 with 300s (1) cores
% 0.38/300.12 # Starting new_bool_1 with 300s (1) cores
% 0.38/300.12 # Starting sh5l with 300s (1) cores
% 0.38/300.12 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32216 completed with status 0
% 0.38/300.12 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/300.12 # No SInE strategy applied
% 0.38/300.12 # Search class: FHHNF-FFSM22-SFFFFFNN
% 0.38/300.12 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/300.12 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.38/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/300.12 # Starting new_bool_3 with 136s (1) cores
% 0.38/300.12 # Starting new_bool_1 with 136s (1) cores
% 0.38/300.12 # Starting sh5l with 136s (1) cores
% 0.38/300.12 # SAT001_MinMin_p005000_rr_RG with pid 32220 completed with status 0
% 0.38/300.12 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.38/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/300.12 # No SInE strategy applied
% 0.38/300.12 # Search class: FHHNF-FFSM22-SFFFFFNN
% 0.38/300.12 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/300.12 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.38/300.12 # Preprocessing time : 0.001 s
% 0.38/300.12 # Presaturation interreduction done
% 0.38/300.12
% 0.38/300.12 # Proof found!
% 0.38/300.12 # SZS status Unsatisfiable
% 0.38/300.12 # SZS output start CNFRefutation
% See solution above
% 0.38/300.12 # Parsed axioms : 14
% 0.38/300.12 # Removed by relevancy pruning/SinE : 0
% 0.38/300.12 # Initial clauses : 14
% 0.38/300.12 # Removed in clause preprocessing : 0
% 0.38/300.12 # Initial clauses in saturation : 14
% 0.38/300.12 # Processed clauses : 49
% 0.38/300.12 # ...of these trivial : 0
% 0.38/300.12 # ...subsumed : 0
% 0.38/300.12 # ...remaining for further processing : 49
% 0.38/300.12 # Other redundant clauses eliminated : 0
% 0.38/300.12 # Clauses deleted for lack of memory : 0
% 0.38/300.12 # Backward-subsumed : 3
% 0.38/300.12 # Backward-rewritten : 2
% 0.38/300.12 # Generated clauses : 24
% 0.38/300.12 # ...of the previous two non-redundant : 24
% 0.38/300.12 # ...aggressively subsumed : 0
% 0.38/300.12 # Contextual simplify-reflections : 0
% 0.38/300.12 # Paramodulations : 24
% 0.38/300.12 # Factorizations : 0
% 0.38/300.12 # NegExts : 0
% 0.38/300.12 # Equation resolutions : 0
% 0.38/300.12 # Total rewrite steps : 19
% 0.38/300.12 # Propositional unsat checks : 0
% 0.38/300.12 # Propositional check models : 0
% 0.38/300.12 # Propositional check unsatisfiable : 0
% 0.38/300.12 # Propositional clauses : 0
% 0.38/300.12 # Propositional clauses after purity: 0
% 0.38/300.12 # Propositional unsat core size : 0
% 0.38/300.12 # Propositional preprocessing time : 0.000
% 0.38/300.12 # Propositional encoding time : 0.000
% 0.38/300.12 # Propositional solver time : 0.000
% 0.38/300.12 # Success case prop preproc time : 0.000
% 0.38/300.12 # Success case prop encoding time : 0.000
% 0.38/300.12 # Success case prop solver time : 0.000
% 0.38/300.12 # Current number of processed clauses : 30
% 0.38/300.12 # Positive orientable unit clauses : 9
% 0.38/300.12 # Positive unorientable unit clauses: 0
% 0.38/300.12 # Negative unit clauses : 1
% 0.38/300.12 # Non-unit-clauses : 20
% 0.38/300.12 # Current number of unprocessed clauses: 3
% 0.38/300.12 # ...number of literals in the above : 26
% 0.38/300.12 # Current number of archived formulas : 0
% 0.38/300.12 # Current number of archived clauses : 19
% 0.38/300.12 # Clause-clause subsumption calls (NU) : 469
% 0.38/300.12 # Rec. Clause-clause subsumption calls : 21
% 0.38/300.12 # Non-unit clause-clause subsumptions : 3
% 0.38/300.12 # Unit Clause-clause subsumption calls : 6
% 0.38/300.12 # Rewrite failures with RHS unbound : 0
% 0.38/300.12 # BW rewrite match attempts : 1
% 0.38/300.12 # BW rewrite match successes : 1
% 0.38/300.12 # Condensation attempts : 0
% 0.38/300.12 # Condensation successes : 0
% 0.38/300.12 # Termbank termtop insertions : 1387
% 0.38/300.12
% 0.38/300.12 # -------------------------------------------------
% 0.38/300.12 # User time : 0.008 s
% 0.38/300.12 # System time : 0.000 s
% 0.38/300.12 # Total time : 0.008 s
% 0.38/300.12 # Maximum resident set size: 1628 pages
% 0.38/300.12
% 0.38/300.12 # -------------------------------------------------
% 0.38/300.12 # User time : 0.030 s
% 0.38/300.12 # System time : 0.006 s
% 0.38/300.12 # Total time : 0.036 s
% 0.38/300.12 # Maximum resident set size: 1688 pages
% 0.38/300.12 % E---3.1 exiting
%------------------------------------------------------------------------------