TSTP Solution File: MGT053+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT053+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:37:16 EDT 2023
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 6 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 74 ( 28 ~; 36 |; 6 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 31 ( 2 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lemma_7,conjecture,
! [X1,X6,X7] :
( dissimilar(X1,X6,X7)
<=> dissimilar(X1,X7,X6) ),
file('/export/starexec/sandbox/tmp/tmp.qcJNjyozAa/E---3.1_8210.p',lemma_7) ).
fof(definition_2,axiom,
! [X1,X4,X5] :
( dissimilar(X1,X4,X5)
<=> ( organization(X1)
& ~ ( is_aligned(X1,X4)
<=> is_aligned(X1,X5) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.qcJNjyozAa/E---3.1_8210.p',definition_2) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X6,X7] :
( dissimilar(X1,X6,X7)
<=> dissimilar(X1,X7,X6) ),
inference(assume_negation,[status(cth)],[lemma_7]) ).
fof(c_0_3,plain,
! [X11,X12,X13] :
( ( organization(X11)
| ~ dissimilar(X11,X12,X13) )
& ( ~ is_aligned(X11,X12)
| ~ is_aligned(X11,X13)
| ~ dissimilar(X11,X12,X13) )
& ( is_aligned(X11,X12)
| is_aligned(X11,X13)
| ~ dissimilar(X11,X12,X13) )
& ( ~ is_aligned(X11,X12)
| is_aligned(X11,X13)
| ~ organization(X11)
| dissimilar(X11,X12,X13) )
& ( ~ is_aligned(X11,X13)
| is_aligned(X11,X12)
| ~ organization(X11)
| dissimilar(X11,X12,X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_2])])]) ).
fof(c_0_4,negated_conjecture,
( ( ~ dissimilar(esk1_0,esk2_0,esk3_0)
| ~ dissimilar(esk1_0,esk3_0,esk2_0) )
& ( dissimilar(esk1_0,esk2_0,esk3_0)
| dissimilar(esk1_0,esk3_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( dissimilar(esk1_0,esk2_0,esk3_0)
| dissimilar(esk1_0,esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( is_aligned(X1,X3)
| dissimilar(X1,X3,X2)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( is_aligned(esk1_0,esk3_0)
| is_aligned(esk1_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_5]) ).
cnf(c_0_10,negated_conjecture,
organization(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( is_aligned(esk1_0,esk2_0)
| is_aligned(esk1_0,X1)
| dissimilar(esk1_0,X1,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_12,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,plain,
( is_aligned(X1,X3)
| dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
( is_aligned(esk1_0,esk2_0)
| dissimilar(esk1_0,esk2_0,esk3_0) ),
inference(ef,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ~ is_aligned(esk1_0,esk2_0)
| ~ is_aligned(esk1_0,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_6]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( is_aligned(esk1_0,X1)
| dissimilar(esk1_0,esk2_0,esk3_0)
| dissimilar(esk1_0,esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10])]) ).
cnf(c_0_17,negated_conjecture,
( ~ dissimilar(esk1_0,esk2_0,esk3_0)
| ~ dissimilar(esk1_0,esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
dissimilar(esk1_0,esk2_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( is_aligned(esk1_0,esk2_0)
| is_aligned(esk1_0,X1)
| dissimilar(esk1_0,esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_10])]) ).
cnf(c_0_20,negated_conjecture,
~ dissimilar(esk1_0,esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
is_aligned(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_19]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
~ is_aligned(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_21])]) ).
cnf(c_0_23,negated_conjecture,
( is_aligned(esk1_0,X1)
| dissimilar(esk1_0,X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_21]),c_0_10])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT053+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n018.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:35:39 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.qcJNjyozAa/E---3.1_8210.p
% 0.22/0.51 # Version: 3.1pre001
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # sh5l with pid 8379 completed with status 0
% 0.22/0.51 # Result found by sh5l
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.51 # SAT001_MinMin_p005000_rr_RG with pid 8382 completed with status 0
% 0.22/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 8
% 0.22/0.51 # Removed by relevancy pruning/SinE : 6
% 0.22/0.51 # Initial clauses : 7
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 7
% 0.22/0.51 # Processed clauses : 31
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 4
% 0.22/0.51 # ...remaining for further processing : 27
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 2
% 0.22/0.51 # Backward-rewritten : 7
% 0.22/0.51 # Generated clauses : 37
% 0.22/0.51 # ...of the previous two non-redundant : 33
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 4
% 0.22/0.51 # Paramodulations : 33
% 0.22/0.51 # Factorizations : 4
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Total rewrite steps : 28
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 11
% 0.22/0.51 # Positive orientable unit clauses : 3
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 2
% 0.22/0.51 # Non-unit-clauses : 6
% 0.22/0.51 # Current number of unprocessed clauses: 13
% 0.22/0.51 # ...number of literals in the above : 50
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 16
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 22
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 15
% 0.22/0.51 # Non-unit clause-clause subsumptions : 8
% 0.22/0.51 # Unit Clause-clause subsumption calls : 3
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 3
% 0.22/0.51 # BW rewrite match successes : 2
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 961
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.004 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.006 s
% 0.22/0.51 # Maximum resident set size: 1740 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.004 s
% 0.22/0.51 # System time : 0.005 s
% 0.22/0.51 # Total time : 0.009 s
% 0.22/0.51 # Maximum resident set size: 1680 pages
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------