TSTP Solution File: REL003-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : REL003-1 : TPTP v8.2.0. 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 : Tue May 21 02:31:19 EDT 2024
% Result : Unsatisfiable 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 8 unt; 4 nHn; 11 RR)
% Number of literals : 26 ( 25 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goals_17,negated_conjecture,
( join(sk1,sk2) != sk2
| join(converse(sk1),converse(sk2)) != converse(sk2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).
cnf(goals_14,negated_conjecture,
( join(sk1,sk2) = sk2
| join(converse(sk1),converse(sk2)) = converse(sk2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(c_0_5,negated_conjecture,
( join(sk1,sk2) != sk2
| join(converse(sk1),converse(sk2)) != converse(sk2) ),
inference(fof_simplification,[status(thm)],[goals_17]) ).
cnf(c_0_6,negated_conjecture,
( join(sk1,sk2) = sk2
| join(converse(sk1),converse(sk2)) = converse(sk2) ),
goals_14 ).
cnf(c_0_7,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_8,negated_conjecture,
( join(sk1,sk2) != sk2
| join(converse(sk1),converse(sk2)) != converse(sk2) ),
c_0_5 ).
cnf(c_0_9,negated_conjecture,
( converse(join(sk1,sk2)) = converse(sk2)
| join(sk1,sk2) = sk2 ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_11,negated_conjecture,
( converse(join(sk1,sk2)) != converse(sk2)
| join(sk1,sk2) != sk2 ),
inference(rw,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_12,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_13,negated_conjecture,
( converse(join(sk2,sk1)) = converse(sk2)
| join(sk2,sk1) = sk2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( converse(join(sk2,sk1)) != converse(sk2)
| join(sk2,sk1) != sk2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
join(sk2,sk1) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : REL003-1 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n025.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 08:09:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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/benchmark/theBenchmark.p
% 0.23/0.53 # Version: 3.1.0
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # new_bool_1 with pid 20791 completed with status 0
% 0.23/0.53 # Result found by new_bool_1
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FGHPM-FFSF21-MFFFFFNN
% 0.23/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.53 # SAT001_MinMin_p005000_rr_RG with pid 20794 completed with status 0
% 0.23/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FGHPM-FFSF21-MFFFFFNN
% 0.23/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.53 # Preprocessing time : 0.001 s
% 0.23/0.53 # Presaturation interreduction done
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Unsatisfiable
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 15
% 0.23/0.53 # Removed by relevancy pruning/SinE : 4
% 0.23/0.53 # Initial clauses : 11
% 0.23/0.53 # Removed in clause preprocessing : 0
% 0.23/0.53 # Initial clauses in saturation : 11
% 0.23/0.53 # Processed clauses : 24
% 0.23/0.53 # ...of these trivial : 0
% 0.23/0.53 # ...subsumed : 0
% 0.23/0.53 # ...remaining for further processing : 24
% 0.23/0.53 # Other redundant clauses eliminated : 0
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 0
% 0.23/0.53 # Backward-rewritten : 6
% 0.23/0.53 # Generated clauses : 21
% 0.23/0.53 # ...of the previous two non-redundant : 21
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 0
% 0.23/0.53 # Paramodulations : 21
% 0.23/0.53 # Factorizations : 0
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 0
% 0.23/0.53 # Disequality decompositions : 0
% 0.23/0.53 # Total rewrite steps : 27
% 0.23/0.53 # ...of those cached : 7
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 7
% 0.23/0.53 # Positive orientable unit clauses : 6
% 0.23/0.53 # Positive unorientable unit clauses: 1
% 0.23/0.53 # Negative unit clauses : 0
% 0.23/0.53 # Non-unit-clauses : 0
% 0.23/0.53 # Current number of unprocessed clauses: 19
% 0.23/0.53 # ...number of literals in the above : 23
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 17
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.53 # Non-unit clause-clause subsumptions : 0
% 0.23/0.53 # Unit Clause-clause subsumption calls : 2
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 10
% 0.23/0.53 # BW rewrite match successes : 10
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 502
% 0.23/0.53 # Search garbage collected termcells : 14
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.004 s
% 0.23/0.53 # System time : 0.001 s
% 0.23/0.53 # Total time : 0.005 s
% 0.23/0.53 # Maximum resident set size: 1640 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.004 s
% 0.23/0.53 # System time : 0.004 s
% 0.23/0.53 # Total time : 0.009 s
% 0.23/0.53 # Maximum resident set size: 1704 pages
% 0.23/0.53 % E---3.1 exiting
% 0.23/0.53 % E exiting
%------------------------------------------------------------------------------