TSTP Solution File: MGT002-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT002-1 : TPTP v8.1.2. Released v2.4.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:35:55 EDT 2023
% Result : Unsatisfiable 0.18s 0.45s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 17 unt; 0 nHn; 34 RR)
% Number of literals : 94 ( 0 equ; 62 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 62 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp4_3,axiom,
( reorganization_free(X1,X3,X3)
| ~ reorganization_free(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',mp4_3) ).
cnf(t2_FOL_9,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',t2_FOL_9) ).
cnf(a3_FOL_4,hypothesis,
( greater(X8,X7)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reproducibility(X1,X5,X2)
| ~ reproducibility(X3,X6,X4)
| ~ inertia(X1,X7,X2)
| ~ inertia(X3,X8,X4)
| ~ greater(X6,X5) ),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',a3_FOL_4) ).
cnf(t2_FOL_11,negated_conjecture,
inertia(sk2,sk4,sk6),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',t2_FOL_11) ).
cnf(t2_FOL_8,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',t2_FOL_8) ).
cnf(a4_FOL_6,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.17kfzGPpXd/E---3.1_16574.p',a4_FOL_6) ).
cnf(t2_FOL_12,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',t2_FOL_12) ).
cnf(t2_FOL_7,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',t2_FOL_7) ).
cnf(mp3_1,axiom,
( reproducibility(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',mp3_1) ).
cnf(mp4_2,axiom,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',mp4_2) ).
cnf(t2_FOL_10,negated_conjecture,
inertia(sk2,sk3,sk5),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',t2_FOL_10) ).
cnf(t2_FOL_13,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox/tmp/tmp.17kfzGPpXd/E---3.1_16574.p',t2_FOL_13) ).
cnf(c_0_12,axiom,
( reorganization_free(X1,X3,X3)
| ~ reorganization_free(X1,X2,X3) ),
mp4_3 ).
cnf(c_0_13,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
t2_FOL_9 ).
cnf(c_0_14,hypothesis,
( greater(X8,X7)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reproducibility(X1,X5,X2)
| ~ reproducibility(X3,X6,X4)
| ~ inertia(X1,X7,X2)
| ~ inertia(X3,X8,X4)
| ~ greater(X6,X5) ),
a3_FOL_4 ).
cnf(c_0_15,negated_conjecture,
inertia(sk2,sk4,sk6),
t2_FOL_11 ).
cnf(c_0_16,negated_conjecture,
reorganization_free(sk2,sk6,sk6),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
organization(sk2,sk6),
t2_FOL_8 ).
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_6 ).
cnf(c_0_19,negated_conjecture,
greater(sk6,sk5),
t2_FOL_12 ).
cnf(c_0_20,negated_conjecture,
organization(sk2,sk5),
t2_FOL_7 ).
cnf(c_0_21,negated_conjecture,
( greater(sk4,X1)
| ~ greater(X2,X3)
| ~ inertia(X4,X1,X5)
| ~ reorganization_free(X4,X5,X5)
| ~ reproducibility(sk2,X2,sk6)
| ~ reproducibility(X4,X3,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_22,axiom,
( reproducibility(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
mp3_1 ).
cnf(c_0_23,negated_conjecture,
( greater(X1,X2)
| ~ reproducibility(sk2,X1,sk6)
| ~ reproducibility(sk2,X2,sk5) ),
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_13]),c_0_19]),c_0_17]),c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
( greater(sk4,X1)
| ~ greater(sk1(sk6,sk2),X2)
| ~ inertia(X3,X1,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ reproducibility(X3,X2,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
( greater(sk1(sk6,sk2),X1)
| ~ reproducibility(sk2,X1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_17])]) ).
cnf(c_0_26,negated_conjecture,
( greater(sk4,X1)
| ~ inertia(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(sk2,X4,sk5)
| ~ reproducibility(X2,X4,X3)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,axiom,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
mp4_2 ).
cnf(c_0_28,negated_conjecture,
( greater(sk4,X1)
| ~ inertia(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X2,sk1(sk5,sk2),X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_20])]) ).
cnf(c_0_29,negated_conjecture,
reorganization_free(sk2,sk5,sk5),
inference(spm,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_30,negated_conjecture,
( greater(sk4,X1)
| ~ inertia(sk2,X1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_22]),c_0_29]),c_0_20])]) ).
cnf(c_0_31,negated_conjecture,
inertia(sk2,sk3,sk5),
t2_FOL_10 ).
cnf(c_0_32,negated_conjecture,
~ greater(sk4,sk3),
t2_FOL_13 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : MGT002-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 00:30:19 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.18/0.44 Running first-order model finding
% 0.18/0.44 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.17kfzGPpXd/E---3.1_16574.p
% 0.18/0.45 # Version: 3.1pre001
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # sh5l with pid 16654 completed with status 0
% 0.18/0.45 # Result found by sh5l
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.45 # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.18/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.45 # SAT001_MinMin_p005000_rr_RG with pid 16660 completed with status 0
% 0.18/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.45 # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.18/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.45 # Preprocessing time : 0.001 s
% 0.18/0.45 # Presaturation interreduction done
% 0.18/0.45
% 0.18/0.45 # Proof found!
% 0.18/0.45 # SZS status Unsatisfiable
% 0.18/0.45 # SZS output start CNFRefutation
% See solution above
% 0.18/0.45 # Parsed axioms : 13
% 0.18/0.45 # Removed by relevancy pruning/SinE : 0
% 0.18/0.45 # Initial clauses : 13
% 0.18/0.45 # Removed in clause preprocessing : 0
% 0.18/0.45 # Initial clauses in saturation : 13
% 0.18/0.45 # Processed clauses : 40
% 0.18/0.45 # ...of these trivial : 0
% 0.18/0.45 # ...subsumed : 0
% 0.18/0.45 # ...remaining for further processing : 40
% 0.18/0.45 # Other redundant clauses eliminated : 0
% 0.18/0.45 # Clauses deleted for lack of memory : 0
% 0.18/0.45 # Backward-subsumed : 0
% 0.18/0.45 # Backward-rewritten : 0
% 0.18/0.45 # Generated clauses : 23
% 0.18/0.45 # ...of the previous two non-redundant : 18
% 0.18/0.45 # ...aggressively subsumed : 0
% 0.18/0.45 # Contextual simplify-reflections : 0
% 0.18/0.45 # Paramodulations : 23
% 0.18/0.45 # Factorizations : 0
% 0.18/0.45 # NegExts : 0
% 0.18/0.45 # Equation resolutions : 0
% 0.18/0.45 # Total rewrite steps : 25
% 0.18/0.45 # Propositional unsat checks : 0
% 0.18/0.45 # Propositional check models : 0
% 0.18/0.45 # Propositional check unsatisfiable : 0
% 0.18/0.45 # Propositional clauses : 0
% 0.18/0.45 # Propositional clauses after purity: 0
% 0.18/0.45 # Propositional unsat core size : 0
% 0.18/0.45 # Propositional preprocessing time : 0.000
% 0.18/0.45 # Propositional encoding time : 0.000
% 0.18/0.45 # Propositional solver time : 0.000
% 0.18/0.45 # Success case prop preproc time : 0.000
% 0.18/0.45 # Success case prop encoding time : 0.000
% 0.18/0.45 # Success case prop solver time : 0.000
% 0.18/0.45 # Current number of processed clauses : 27
% 0.18/0.45 # Positive orientable unit clauses : 8
% 0.18/0.45 # Positive unorientable unit clauses: 0
% 0.18/0.45 # Negative unit clauses : 1
% 0.18/0.45 # Non-unit-clauses : 18
% 0.18/0.45 # Current number of unprocessed clauses: 4
% 0.18/0.45 # ...number of literals in the above : 27
% 0.18/0.45 # Current number of archived formulas : 0
% 0.18/0.45 # Current number of archived clauses : 13
% 0.18/0.45 # Clause-clause subsumption calls (NU) : 141
% 0.18/0.45 # Rec. Clause-clause subsumption calls : 48
% 0.18/0.45 # Non-unit clause-clause subsumptions : 0
% 0.18/0.45 # Unit Clause-clause subsumption calls : 0
% 0.18/0.45 # Rewrite failures with RHS unbound : 0
% 0.18/0.45 # BW rewrite match attempts : 1
% 0.18/0.45 # BW rewrite match successes : 0
% 0.18/0.45 # Condensation attempts : 0
% 0.18/0.45 # Condensation successes : 0
% 0.18/0.45 # Termbank termtop insertions : 1039
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.003 s
% 0.18/0.45 # System time : 0.002 s
% 0.18/0.45 # Total time : 0.005 s
% 0.18/0.45 # Maximum resident set size: 1632 pages
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.005 s
% 0.18/0.45 # System time : 0.002 s
% 0.18/0.45 # Total time : 0.008 s
% 0.18/0.45 # Maximum resident set size: 1684 pages
% 0.18/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------