TSTP Solution File: MGT003-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT003-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:34:30 EDT 2023
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 32 ( 16 unt; 0 nHn; 32 RR)
% Number of literals : 99 ( 0 equ; 69 neg)
% Maximal clause size : 10 ( 3 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 : 64 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp4_2,axiom,
( reorganization_free(X1,X3,X3)
| ~ reorganization_free(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',mp4_2) ).
cnf(t3_FOL_8,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',t3_FOL_8) ).
cnf(t1_FOL_4,hypothesis,
( greater(X8,X7)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X1,X5,X2)
| ~ inertia(X3,X6,X4)
| ~ survival_chance(X1,X7,X2)
| ~ survival_chance(X3,X8,X4)
| ~ greater(X6,X5) ),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',t1_FOL_4) ).
cnf(t3_FOL_10,negated_conjecture,
survival_chance(sk2,sk4,sk6),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',t3_FOL_10) ).
cnf(t3_FOL_7,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',t3_FOL_7) ).
cnf(t2_FOL_5,hypothesis,
( greater(X5,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ inertia(X1,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ greater(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',t2_FOL_5) ).
cnf(mp5_3,axiom,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',mp5_3) ).
cnf(mp4_1,axiom,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',mp4_1) ).
cnf(t3_FOL_9,negated_conjecture,
survival_chance(sk2,sk3,sk5),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',t3_FOL_9) ).
cnf(t3_FOL_11,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',t3_FOL_11) ).
cnf(t3_FOL_6,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',t3_FOL_6) ).
cnf(t3_FOL_12,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p',t3_FOL_12) ).
cnf(c_0_12,axiom,
( reorganization_free(X1,X3,X3)
| ~ reorganization_free(X1,X2,X3) ),
mp4_2 ).
cnf(c_0_13,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
t3_FOL_8 ).
cnf(c_0_14,hypothesis,
( greater(X8,X7)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X1,X5,X2)
| ~ inertia(X3,X6,X4)
| ~ survival_chance(X1,X7,X2)
| ~ survival_chance(X3,X8,X4)
| ~ greater(X6,X5) ),
t1_FOL_4 ).
cnf(c_0_15,negated_conjecture,
survival_chance(sk2,sk4,sk6),
t3_FOL_10 ).
cnf(c_0_16,negated_conjecture,
organization(sk2,sk6),
t3_FOL_7 ).
cnf(c_0_17,negated_conjecture,
reorganization_free(sk2,sk6,sk6),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
( greater(X5,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ inertia(X1,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ greater(X3,X2) ),
t2_FOL_5 ).
cnf(c_0_19,axiom,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
mp5_3 ).
cnf(c_0_20,negated_conjecture,
( greater(sk4,X1)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| ~ inertia(sk2,X2,sk6)
| ~ inertia(X4,X3,X5)
| ~ organization(X4,X5)
| ~ reorganization_free(X4,X5,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_21,hypothesis,
( greater(sk1(X1,X2),X3)
| ~ greater(X1,X4)
| ~ inertia(X2,X3,X4)
| ~ organization(X2,X1)
| ~ organization(X2,X4)
| ~ reorganization_free(X2,X4,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( greater(sk4,X1)
| ~ greater(sk1(sk6,sk2),X2)
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4)
| ~ reorganization_free(X3,X4,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_16])]) ).
cnf(c_0_23,hypothesis,
( greater(sk1(X1,X2),sk1(X3,X2))
| ~ greater(X1,X3)
| ~ organization(X2,X1)
| ~ organization(X2,X3)
| ~ reorganization_free(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_24,hypothesis,
( greater(sk4,X1)
| ~ greater(sk6,X2)
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,sk1(X2,sk2),X4)
| ~ organization(sk2,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(sk2,X2,sk6)
| ~ reorganization_free(X3,X4,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_16])]) ).
cnf(c_0_25,axiom,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
mp4_1 ).
cnf(c_0_26,hypothesis,
( greater(sk4,X1)
| ~ greater(sk6,X2)
| ~ survival_chance(sk2,X1,X2)
| ~ organization(sk2,X2)
| ~ reorganization_free(sk2,X2,sk6) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_25]) ).
cnf(c_0_27,negated_conjecture,
survival_chance(sk2,sk3,sk5),
t3_FOL_9 ).
cnf(c_0_28,negated_conjecture,
greater(sk6,sk5),
t3_FOL_11 ).
cnf(c_0_29,negated_conjecture,
organization(sk2,sk5),
t3_FOL_6 ).
cnf(c_0_30,negated_conjecture,
~ greater(sk4,sk3),
t3_FOL_12 ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_13])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : MGT003-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n016.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 00:55:22 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.zvgj5Qgswq/E---3.1_16014.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # sh5l with pid 16095 completed with status 0
% 0.20/0.50 # Result found by sh5l
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 16100 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 12
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 12
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 12
% 0.20/0.50 # Processed clauses : 34
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 34
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 17
% 0.20/0.50 # ...of the previous two non-redundant : 12
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 1
% 0.20/0.50 # Paramodulations : 17
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 17
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 22
% 0.20/0.50 # Positive orientable unit clauses : 8
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 13
% 0.20/0.50 # Current number of unprocessed clauses: 1
% 0.20/0.50 # ...number of literals in the above : 8
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 12
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 72
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 25
% 0.20/0.50 # Non-unit clause-clause subsumptions : 1
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 1
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 788
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.004 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.005 s
% 0.20/0.50 # Maximum resident set size: 1636 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.007 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.008 s
% 0.20/0.50 # Maximum resident set size: 1684 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------