TSTP Solution File: BOO072-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : BOO072-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 17:18:18 EDT 2023
% Result : Unsatisfiable 0.14s 0.55s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 2
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 3 RR)
% Number of literals : 36 ( 35 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 3 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 : 67 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(dn1,axiom,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))) = X3,
file('/export/starexec/sandbox/tmp/tmp.kgZwbN33v0/E---3.1_9451.p',dn1) ).
cnf(huntinton_1,negated_conjecture,
add(b,a) != add(a,b),
file('/export/starexec/sandbox/tmp/tmp.kgZwbN33v0/E---3.1_9451.p',huntinton_1) ).
cnf(c_0_2,axiom,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))) = X3,
dn1 ).
cnf(c_0_3,plain,
inverse(add(inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(X1)),X2)),X1)),X3)),inverse(X1))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(add(inverse(add(X1,inverse(X1))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
inverse(add(inverse(X1),inverse(add(X1,inverse(add(inverse(X1),inverse(add(X1,X2)))))))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,X3)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_5]) ).
cnf(c_0_7,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(X1),X2)))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
inverse(add(inverse(X1),inverse(add(X1,X1)))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_9,plain,
inverse(add(inverse(add(X1,inverse(add(X1,X1)))),X1)) = inverse(add(X1,X1)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
inverse(add(inverse(add(X1,X1)),inverse(add(X1,X1)))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_11,plain,
inverse(add(inverse(add(add(X1,X1),inverse(add(X1,X1)))),X1)) = inverse(add(X1,X1)),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_12,plain,
inverse(add(inverse(add(X1,X1)),inverse(add(add(X1,X1),X1)))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_13,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_12]) ).
cnf(c_0_14,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X1)),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_15,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_13]),c_0_13]) ).
cnf(c_0_16,plain,
inverse(add(X1,add(X2,X1))) = inverse(add(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_6]),c_0_15]) ).
cnf(c_0_17,plain,
add(X1,add(X2,X1)) = add(X2,X1),
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_16]),c_0_13]),c_0_16]),c_0_13]),c_0_15]) ).
cnf(c_0_18,plain,
add(inverse(add(X1,X2)),inverse(add(inverse(X1),X2))) = inverse(X2),
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_19,plain,
add(inverse(add(inverse(X1),X2)),inverse(X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
add(inverse(add(inverse(X1),inverse(X2))),X2) = X2,
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_21,plain,
add(inverse(add(X1,inverse(X2))),X2) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_22,plain,
inverse(add(inverse(X1),inverse(add(X2,X1)))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_23,plain,
add(inverse(X1),inverse(add(X2,X1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_24,plain,
inverse(add(X1,inverse(add(inverse(add(X2,X3)),inverse(add(X2,X1)))))) = inverse(add(X2,X1)),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_25,plain,
add(X1,inverse(add(X2,inverse(X1)))) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_26,plain,
inverse(add(X1,add(X1,X2))) = inverse(add(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]),c_0_15]),c_0_13]),c_0_15]) ).
cnf(c_0_27,plain,
inverse(add(inverse(X1),inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(X1)),X2)),X1)),X3)),inverse(add(inverse(X1),inverse(add(X1,X4)))))))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_28,plain,
add(X1,add(X1,X2)) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_15]) ).
cnf(c_0_29,plain,
inverse(add(inverse(X1),inverse(add(X1,X2)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_15]),c_0_28]) ).
cnf(c_0_30,plain,
add(add(X1,X2),X1) = add(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_29]),c_0_15]),c_0_15]) ).
cnf(c_0_31,plain,
add(X1,inverse(add(inverse(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_32,plain,
inverse(add(X1,X2)) = inverse(add(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_31]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
add(b,a) != add(a,b),
huntinton_1 ).
cnf(c_0_34,plain,
add(X1,X2) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_32]),c_0_15]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : BOO072-1 : TPTP v8.1.2. Released v2.6.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n010.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 20:25:35 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.kgZwbN33v0/E---3.1_9451.p
% 0.14/0.55 # Version: 3.1pre001
% 0.14/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.55 # Starting sh5l with 300s (1) cores
% 0.14/0.55 # new_bool_1 with pid 9531 completed with status 8
% 0.14/0.55 # new_bool_3 with pid 9530 completed with status 8
% 0.14/0.55 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9529 completed with status 0
% 0.14/0.55 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.55 # No SInE strategy applied
% 0.14/0.55 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.14/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.14/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.55 # Starting sh5l with 136s (1) cores
% 0.14/0.55 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9535 completed with status 0
% 0.14/0.55 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.55 # No SInE strategy applied
% 0.14/0.55 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.14/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.14/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.55 # Preprocessing time : 0.001 s
% 0.14/0.55
% 0.14/0.55 # Proof found!
% 0.14/0.55 # SZS status Unsatisfiable
% 0.14/0.55 # SZS output start CNFRefutation
% See solution above
% 0.14/0.55 # Parsed axioms : 2
% 0.14/0.55 # Removed by relevancy pruning/SinE : 0
% 0.14/0.55 # Initial clauses : 2
% 0.14/0.55 # Removed in clause preprocessing : 0
% 0.14/0.55 # Initial clauses in saturation : 2
% 0.14/0.55 # Processed clauses : 165
% 0.14/0.55 # ...of these trivial : 70
% 0.14/0.55 # ...subsumed : 0
% 0.14/0.55 # ...remaining for further processing : 95
% 0.14/0.55 # Other redundant clauses eliminated : 0
% 0.14/0.55 # Clauses deleted for lack of memory : 0
% 0.14/0.55 # Backward-subsumed : 1
% 0.14/0.55 # Backward-rewritten : 72
% 0.14/0.55 # Generated clauses : 8707
% 0.14/0.55 # ...of the previous two non-redundant : 6334
% 0.14/0.55 # ...aggressively subsumed : 0
% 0.14/0.55 # Contextual simplify-reflections : 0
% 0.14/0.55 # Paramodulations : 8707
% 0.14/0.55 # Factorizations : 0
% 0.14/0.55 # NegExts : 0
% 0.14/0.55 # Equation resolutions : 0
% 0.14/0.55 # Total rewrite steps : 12869
% 0.14/0.55 # Propositional unsat checks : 0
% 0.14/0.55 # Propositional check models : 0
% 0.14/0.55 # Propositional check unsatisfiable : 0
% 0.14/0.55 # Propositional clauses : 0
% 0.14/0.55 # Propositional clauses after purity: 0
% 0.14/0.55 # Propositional unsat core size : 0
% 0.14/0.55 # Propositional preprocessing time : 0.000
% 0.14/0.55 # Propositional encoding time : 0.000
% 0.14/0.55 # Propositional solver time : 0.000
% 0.14/0.55 # Success case prop preproc time : 0.000
% 0.14/0.55 # Success case prop encoding time : 0.000
% 0.14/0.55 # Success case prop solver time : 0.000
% 0.14/0.55 # Current number of processed clauses : 22
% 0.14/0.55 # Positive orientable unit clauses : 21
% 0.14/0.55 # Positive unorientable unit clauses: 1
% 0.14/0.55 # Negative unit clauses : 0
% 0.14/0.55 # Non-unit-clauses : 0
% 0.14/0.55 # Current number of unprocessed clauses: 6029
% 0.14/0.55 # ...number of literals in the above : 6029
% 0.14/0.55 # Current number of archived formulas : 0
% 0.14/0.55 # Current number of archived clauses : 73
% 0.14/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.55 # Non-unit clause-clause subsumptions : 0
% 0.14/0.55 # Unit Clause-clause subsumption calls : 44
% 0.14/0.55 # Rewrite failures with RHS unbound : 0
% 0.14/0.55 # BW rewrite match attempts : 1217
% 0.14/0.55 # BW rewrite match successes : 173
% 0.14/0.55 # Condensation attempts : 0
% 0.14/0.55 # Condensation successes : 0
% 0.14/0.55 # Termbank termtop insertions : 225359
% 0.14/0.55
% 0.14/0.55 # -------------------------------------------------
% 0.14/0.55 # User time : 0.145 s
% 0.14/0.55 # System time : 0.004 s
% 0.14/0.55 # Total time : 0.149 s
% 0.14/0.55 # Maximum resident set size: 1504 pages
% 0.14/0.55
% 0.14/0.55 # -------------------------------------------------
% 0.14/0.55 # User time : 0.750 s
% 0.14/0.55 # System time : 0.029 s
% 0.14/0.55 # Total time : 0.779 s
% 0.14/0.55 # Maximum resident set size: 1672 pages
% 0.14/0.55 % E---3.1 exiting
% 0.14/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------