TSTP Solution File: LCL156-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL156-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:23:56 EDT 2023
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 10 RR)
% Number of literals : 31 ( 30 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox/tmp/tmp.ogDN60wHI8/E---3.1_18962.p',wajsberg_4) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.ogDN60wHI8/E---3.1_18962.p',wajsberg_1) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox/tmp/tmp.ogDN60wHI8/E---3.1_18962.p',false_definition) ).
cnf(or_commutativity,axiom,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.ogDN60wHI8/E---3.1_18962.p',or_commutativity) ).
cnf(or_definition,axiom,
or(X1,X2) = implies(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.ogDN60wHI8/E---3.1_18962.p',or_definition) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/tmp/tmp.ogDN60wHI8/E---3.1_18962.p',wajsberg_3) ).
cnf(and_star_definition,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.ogDN60wHI8/E---3.1_18962.p',and_star_definition) ).
cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
and_star(x,truth) != x,
file('/export/starexec/sandbox/tmp/tmp.ogDN60wHI8/E---3.1_18962.p',prove_alternative_wajsberg_axiom) ).
cnf(c_0_8,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_9,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_10,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_11,axiom,
or(X1,X2) = or(X2,X1),
or_commutativity ).
cnf(c_0_12,axiom,
or(X1,X2) = implies(not(X1),X2),
or_definition ).
cnf(c_0_13,plain,
implies(implies(not(X1),falsehood),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_15,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_16,plain,
implies(implies(not(falsehood),X1),X1) = truth,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_18,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
and_star_definition ).
cnf(c_0_19,plain,
implies(not(falsehood),not(falsehood)) = truth,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
and_star(x,truth) != x,
prove_alternative_wajsberg_axiom ).
cnf(c_0_21,plain,
and_star(X1,X2) = not(implies(not(not(X1)),not(X2))),
inference(rw,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_22,plain,
not(falsehood) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_9]) ).
cnf(c_0_23,negated_conjecture,
not(implies(not(not(x)),not(truth))) != x,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
implies(implies(not(not(X1)),X2),implies(X1,X2)) = truth,
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_25,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_22]),c_0_9]) ).
cnf(c_0_26,negated_conjecture,
not(implies(not(falsehood),not(x))) != x,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_14]),c_0_10]) ).
cnf(c_0_27,plain,
implies(X1,not(not(X1))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_9]) ).
cnf(c_0_28,negated_conjecture,
not(not(x)) != x,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_9]) ).
cnf(c_0_29,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_27]),c_0_9]),c_0_14]),c_0_25]),c_0_9]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL156-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 12:17:00 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.ogDN60wHI8/E---3.1_18962.p
% 0.19/0.48 # Version: 3.1pre001
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19060 completed with status 0
% 0.19/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FUUPM-FFSF21-DFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.48 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.48 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 19072 completed with status 0
% 0.19/0.48 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FUUPM-FFSF21-DFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.48 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 17
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 17
% 0.19/0.48 # Removed in clause preprocessing : 3
% 0.19/0.48 # Initial clauses in saturation : 14
% 0.19/0.48 # Processed clauses : 60
% 0.19/0.48 # ...of these trivial : 17
% 0.19/0.48 # ...subsumed : 4
% 0.19/0.48 # ...remaining for further processing : 39
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 7
% 0.19/0.48 # Generated clauses : 226
% 0.19/0.48 # ...of the previous two non-redundant : 130
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 226
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Total rewrite steps : 294
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 21
% 0.19/0.48 # Positive orientable unit clauses : 17
% 0.19/0.48 # Positive unorientable unit clauses: 3
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 0
% 0.19/0.48 # Current number of unprocessed clauses: 90
% 0.19/0.48 # ...number of literals in the above : 90
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 21
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 6
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 86
% 0.19/0.48 # BW rewrite match successes : 23
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 2735
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.008 s
% 0.19/0.48 # System time : 0.000 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1592 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.035 s
% 0.19/0.48 # System time : 0.003 s
% 0.19/0.48 # Total time : 0.038 s
% 0.19/0.48 # Maximum resident set size: 1672 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------