TSTP Solution File: REL009+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : REL009+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Sat May 4 09:12:51 EDT 2024
% Result : Theorem 0.17s 0.43s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 19 unt; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 2 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/tmp/tmp.cWZM1HMXg3/E---3.1_31971.p',converse_additivity) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.cWZM1HMXg3/E---3.1_31971.p',composition_distributivity) ).
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/tmp/tmp.cWZM1HMXg3/E---3.1_31971.p',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.cWZM1HMXg3/E---3.1_31971.p',converse_idempotence) ).
fof(goals,conjecture,
! [X1,X2,X3] :
( join(X1,X2) = X2
=> ( join(composition(X1,X3),composition(X2,X3)) = composition(X2,X3)
& join(composition(X3,X1),composition(X3,X2)) = composition(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.cWZM1HMXg3/E---3.1_31971.p',goals) ).
fof(c_0_5,plain,
! [X21,X22] : converse(join(X21,X22)) = join(converse(X21),converse(X22)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
fof(c_0_6,plain,
! [X10,X11,X12] : composition(join(X10,X11),X12) = join(composition(X10,X12),composition(X11,X12)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
fof(c_0_7,plain,
! [X13,X14] : converse(composition(X13,X14)) = composition(converse(X14),converse(X13)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
cnf(c_0_8,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2,X3] :
( join(X1,X2) = X2
=> ( join(composition(X1,X3),composition(X2,X3)) = composition(X2,X3)
& join(composition(X3,X1),composition(X3,X2)) = composition(X3,X2) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_13,plain,
join(composition(converse(X1),converse(X2)),composition(converse(X1),converse(X3))) = composition(converse(X1),join(converse(X2),converse(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_8]),c_0_10]),c_0_10]) ).
cnf(c_0_14,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,negated_conjecture,
( join(esk1_0,esk2_0) = esk2_0
& ( join(composition(esk1_0,esk3_0),composition(esk2_0,esk3_0)) != composition(esk2_0,esk3_0)
| join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_16,plain,
join(composition(X1,converse(X2)),composition(X1,converse(X3))) = composition(X1,join(converse(X2),converse(X3))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( join(composition(esk1_0,esk3_0),composition(esk2_0,esk3_0)) != composition(esk2_0,esk3_0)
| join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
join(esk1_0,esk2_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
join(composition(X1,converse(X2)),composition(X1,X3)) = composition(X1,join(converse(X2),X3)),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_9]),c_0_18])]) ).
cnf(c_0_21,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : REL009+2 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n025.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 09:57:28 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.17/0.41 Running first-order theorem proving
% 0.17/0.41 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.cWZM1HMXg3/E---3.1_31971.p
% 0.17/0.43 # Version: 3.1.0
% 0.17/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43 # Starting sh5l with 300s (1) cores
% 0.17/0.43 # new_bool_3 with pid 32050 completed with status 0
% 0.17/0.43 # Result found by new_bool_3
% 0.17/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.43 # Search class: FUHPM-FFMF21-DFFFFFNN
% 0.17/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 0.17/0.43 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 32056 completed with status 0
% 0.17/0.43 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.17/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.43 # Search class: FUHPM-FFMF21-DFFFFFNN
% 0.17/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 0.17/0.43 # Preprocessing time : 0.001 s
% 0.17/0.43
% 0.17/0.43 # Proof found!
% 0.17/0.43 # SZS status Theorem
% 0.17/0.43 # SZS output start CNFRefutation
% See solution above
% 0.17/0.43 # Parsed axioms : 17
% 0.17/0.43 # Removed by relevancy pruning/SinE : 3
% 0.17/0.43 # Initial clauses : 15
% 0.17/0.43 # Removed in clause preprocessing : 0
% 0.17/0.43 # Initial clauses in saturation : 15
% 0.17/0.43 # Processed clauses : 127
% 0.17/0.43 # ...of these trivial : 33
% 0.17/0.43 # ...subsumed : 48
% 0.17/0.43 # ...remaining for further processing : 46
% 0.17/0.43 # Other redundant clauses eliminated : 0
% 0.17/0.43 # Clauses deleted for lack of memory : 0
% 0.17/0.43 # Backward-subsumed : 0
% 0.17/0.43 # Backward-rewritten : 7
% 0.17/0.43 # Generated clauses : 724
% 0.17/0.43 # ...of the previous two non-redundant : 597
% 0.17/0.43 # ...aggressively subsumed : 0
% 0.17/0.43 # Contextual simplify-reflections : 0
% 0.17/0.43 # Paramodulations : 724
% 0.17/0.43 # Factorizations : 0
% 0.17/0.43 # NegExts : 0
% 0.17/0.43 # Equation resolutions : 0
% 0.17/0.43 # Disequality decompositions : 0
% 0.17/0.43 # Total rewrite steps : 601
% 0.17/0.43 # ...of those cached : 315
% 0.17/0.43 # Propositional unsat checks : 0
% 0.17/0.43 # Propositional check models : 0
% 0.17/0.43 # Propositional check unsatisfiable : 0
% 0.17/0.43 # Propositional clauses : 0
% 0.17/0.43 # Propositional clauses after purity: 0
% 0.17/0.43 # Propositional unsat core size : 0
% 0.17/0.43 # Propositional preprocessing time : 0.000
% 0.17/0.43 # Propositional encoding time : 0.000
% 0.17/0.43 # Propositional solver time : 0.000
% 0.17/0.43 # Success case prop preproc time : 0.000
% 0.17/0.43 # Success case prop encoding time : 0.000
% 0.17/0.43 # Success case prop solver time : 0.000
% 0.17/0.43 # Current number of processed clauses : 39
% 0.17/0.43 # Positive orientable unit clauses : 34
% 0.17/0.43 # Positive unorientable unit clauses: 5
% 0.17/0.43 # Negative unit clauses : 0
% 0.17/0.43 # Non-unit-clauses : 0
% 0.17/0.43 # Current number of unprocessed clauses: 485
% 0.17/0.43 # ...number of literals in the above : 485
% 0.17/0.43 # Current number of archived formulas : 0
% 0.17/0.43 # Current number of archived clauses : 7
% 0.17/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.43 # Non-unit clause-clause subsumptions : 0
% 0.17/0.43 # Unit Clause-clause subsumption calls : 16
% 0.17/0.43 # Rewrite failures with RHS unbound : 0
% 0.17/0.43 # BW rewrite match attempts : 105
% 0.17/0.43 # BW rewrite match successes : 91
% 0.17/0.43 # Condensation attempts : 0
% 0.17/0.43 # Condensation successes : 0
% 0.17/0.43 # Termbank termtop insertions : 8384
% 0.17/0.43 # Search garbage collected termcells : 57
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.009 s
% 0.17/0.43 # System time : 0.003 s
% 0.17/0.43 # Total time : 0.012 s
% 0.17/0.43 # Maximum resident set size: 1760 pages
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.010 s
% 0.17/0.43 # System time : 0.005 s
% 0.17/0.43 # Total time : 0.015 s
% 0.17/0.43 # Maximum resident set size: 1696 pages
% 0.17/0.43 % E---3.1 exiting
% 0.17/0.43 % E exiting
%------------------------------------------------------------------------------