TSTP Solution File: REL049+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : REL049+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 19:13:57 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 14 unt; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 4 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X1,X2,X3] :
( ( join(X1,X2) = X2
& join(X3,X2) = X2 )
=> join(join(X1,X3),X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.1Jrh4muEgD/E---3.1_5622.p',goals) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.1Jrh4muEgD/E---3.1_5622.p',maddux1_join_commutativity) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.1Jrh4muEgD/E---3.1_5622.p',maddux2_join_associativity) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( join(X1,X2) = X2
& join(X3,X2) = X2 )
=> join(join(X1,X3),X2) = X2 ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,negated_conjecture,
( join(esk1_0,esk2_0) = esk2_0
& join(esk3_0,esk2_0) = esk2_0
& join(join(esk1_0,esk3_0),esk2_0) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X7,X8] : join(X7,X8) = join(X8,X7),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
fof(c_0_6,plain,
! [X9,X10,X11] : join(X9,join(X10,X11)) = join(join(X9,X10),X11),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_7,negated_conjecture,
join(esk1_0,esk2_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
join(join(esk1_0,esk3_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
join(esk2_0,esk1_0) = esk2_0,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
join(esk3_0,esk2_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
join(esk2_0,join(esk1_0,esk3_0)) != esk2_0,
inference(rw,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
join(esk2_0,join(esk1_0,X1)) = join(esk2_0,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
join(esk2_0,esk3_0) = esk2_0,
inference(rw,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : REL049+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n020.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 15:19:16 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.1Jrh4muEgD/E---3.1_5622.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_3 with pid 5702 completed with status 0
% 0.17/0.46 # Result found by new_bool_3
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FUUPS-FFSF22-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 5706 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FUUPS-FFSF22-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 14
% 0.17/0.46 # Removed by relevancy pruning/SinE : 11
% 0.17/0.46 # Initial clauses : 5
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 5
% 0.17/0.46 # Processed clauses : 14
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 0
% 0.17/0.46 # ...remaining for further processing : 14
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 4
% 0.17/0.46 # Generated clauses : 10
% 0.17/0.46 # ...of the previous two non-redundant : 9
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 10
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 10
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 5
% 0.17/0.46 # Positive orientable unit clauses : 4
% 0.17/0.46 # Positive unorientable unit clauses: 1
% 0.17/0.46 # Negative unit clauses : 0
% 0.17/0.46 # Non-unit-clauses : 0
% 0.17/0.46 # Current number of unprocessed clauses: 5
% 0.17/0.46 # ...number of literals in the above : 5
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 9
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.46 # Non-unit clause-clause subsumptions : 0
% 0.17/0.46 # Unit Clause-clause subsumption calls : 0
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 13
% 0.17/0.46 # BW rewrite match successes : 13
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 377
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.003 s
% 0.17/0.46 # System time : 0.000 s
% 0.17/0.46 # Total time : 0.004 s
% 0.17/0.46 # Maximum resident set size: 1620 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.003 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.006 s
% 0.17/0.46 # Maximum resident set size: 1684 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------