↑ Up

E---3.5.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL407-2 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:12:40 PM UTC 2026

% Result   : Satisfiable 0.13s 10.45s
% Output   : Saturation 0.13s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named axiom_8ERROR: Could not build tree for root c_0_26ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_7,axiom,
    xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
    axiom_7,
    [final] ).

cnf(c_0_8,axiom,
    xor(X1,X1) = falsehood,
    axiom_3,
    [final] ).

cnf(c_0_9,plain,
    xor(truth,xor(truth,X1)) = xor(falsehood,X1),
    inference(spm,[status(thm)],[c_0_7,c_0_8]),
    [final] ).

cnf(c_0_10,plain,
    xor(X1,xor(truth,xor(X1,truth))) = falsehood,
    inference(spm,[status(thm)],[c_0_8,c_0_7]),
    [final] ).

cnf(c_0_11,axiom,
    xor(X1,falsehood) = X1,
    axiom_2,
    [final] ).

cnf(c_0_12,axiom,
    and_star(xor(truth,X1),X1) = falsehood,
    axiom_6,
    [final] ).

cnf(c_0_13,plain,
    xor(falsehood,truth) = truth,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_8]),c_0_11]),
    [final] ).

cnf(c_0_14,axiom,
    and_star(xor(and_star(xor(truth,X1),X2),truth),X2) = and_star(xor(and_star(xor(truth,X2),X1),truth),X1),
    axiom_8,
    [final] ).

cnf(c_0_15,plain,
    xor(X1,xor(falsehood,X2)) = xor(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_7]),c_0_8]),c_0_11]),c_0_7]),c_0_9]),
    [final] ).

cnf(c_0_16,plain,
    and_star(xor(falsehood,X1),xor(truth,X1)) = falsehood,
    inference(spm,[status(thm)],[c_0_12,c_0_9]),
    [final] ).

cnf(c_0_17,plain,
    xor(falsehood,xor(truth,X1)) = xor(truth,X1),
    inference(spm,[status(thm)],[c_0_7,c_0_13]),
    [final] ).

cnf(c_0_19,axiom,
    and_star(X1,falsehood) = falsehood,
    axiom_5,
    [final] ).

cnf(c_0_20,plain,
    and_star(xor(truth,X1),xor(falsehood,X1)) = falsehood,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_9]),
    [final] ).

cnf(c_0_21,plain,
    and_star(xor(and_star(xor(truth,X1),xor(truth,X2)),truth),xor(truth,X2)) = and_star(xor(and_star(xor(falsehood,X2),X1),truth),X1),
    inference(spm,[status(thm)],[c_0_14,c_0_9]),
    [final] ).

cnf(c_0_22,plain,
    and_star(xor(and_star(xor(truth,X1),xor(falsehood,X2)),truth),xor(falsehood,X2)) = and_star(xor(and_star(xor(truth,X1),X2),truth),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_18]),c_0_15]),
    [final] ).

cnf(c_0_23,axiom,
    and_star(X1,truth) = X1,
    axiom_4,
    [final] ).

cnf(c_0_24,plain,
    and_star(xor(and_star(truth,X1),truth),X1) = falsehood,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_14]),c_0_11]),
    [final] ).

cnf(c_0_25,plain,
    and_star(truth,xor(falsehood,X1)) = and_star(truth,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_13]),c_0_15]),c_0_12]),c_0_13]),
    [final] ).

cnf(c_0_26,plain,
    and_star(xor(and_star(xor(falsehood,X1),xor(truth,X2)),truth),xor(truth,X2)) = and_star(xor(and_star(xor(falsehood,X2),xor(truth,X1)),truth),xor(truth,X1)),
    inference(spm,[status(thm)],[c_0_21,c_0_9]),
    [final] ).

cnf(c_0_27,plain,
    and_star(xor(and_star(xor(falsehood,X1),xor(falsehood,X2)),truth),xor(falsehood,X2)) = and_star(xor(and_star(xor(falsehood,X1),X2),truth),X2),
    inference(spm,[status(thm)],[c_0_22,c_0_9]),
    [final] ).

cnf(c_0_28,plain,
    and_star(xor(and_star(falsehood,X1),truth),X1) = xor(xor(truth,X1),truth),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_14]),c_0_8]),c_0_23]),
    [final] ).

cnf(c_0_29,plain,
    and_star(xor(and_star(truth,X1),truth),xor(falsehood,X1)) = falsehood,
    inference(spm,[status(thm)],[c_0_24,c_0_25]),
    [final] ).

cnf(c_0_30,plain,
    xor(xor(falsehood,X1),X1) = falsehood,
    inference(spm,[status(thm)],[c_0_8,c_0_15]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL407-2 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/10.38  % Computer : n019.cluster.edu
% 0.10/10.38  % Model    : x86_64 x86_64
% 0.10/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38  % Memory   : 8046.5625MB
% 0.10/10.38  % OS       : Linux 6.8.0-71-generic
% 0.10/10.38  % CPULimit : 300
% 0.10/10.38  % WCLimit  : 300
% 0.10/10.38  % DateTime : Mon Sep 21 00:29:16 UTC 2026
% 0.10/10.38  % CPUTime  : 
% 0.10/10.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/10.42  Running first-order theorem proving
% 0.13/10.42  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.13/10.45  % Version: 3.5.1
% 0.13/10.45  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/10.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.45  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/10.45  % Starting new_bool_3 with 300s (1) cores
% 0.13/10.45  % Starting new_bool_1 with 300s (1) cores
% 0.13/10.45  % Starting sh5l with 300s (1) cores
% 0.13/10.45  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1307450 completed with status 1
% 0.13/10.45  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.13/10.45  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/10.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.45  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/10.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/10.45  % No SInE strategy applied
% 0.13/10.45  % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.13/10.45  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/10.45  % Starting SubtermCWHack with 136s (1) cores
% 0.13/10.45  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/10.45  % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.13/10.45  % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/10.45  % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/10.45  % SubtermCWHack with pid 1307454 completed with status 1
% 0.13/10.45  % Result found by SubtermCWHack
% 0.13/10.45  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/10.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.45  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/10.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/10.45  % No SInE strategy applied
% 0.13/10.45  % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.13/10.45  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/10.45  % Starting SubtermCWHack with 136s (1) cores
% 0.13/10.45  % Preprocessing time       : 0.001 s
% 0.13/10.45  
% 0.13/10.45  % No proof found!
% 0.13/10.45  % SZS status Satisfiable
% 0.13/10.45  % SZS output start Saturation
% See solution above
% 0.13/10.45  % Parsed axioms                        : 8
% 0.13/10.45  % Removed by relevancy pruning/SinE    : 0
% 0.13/10.45  % Initial clauses                      : 8
% 0.13/10.45  % Removed in clause preprocessing      : 1
% 0.13/10.45  % Initial clauses in saturation        : 7
% 0.13/10.45  % Processed clauses                    : 74
% 0.13/10.45  % ...of these trivial                  : 20
% 0.13/10.45  % ...subsumed                          : 28
% 0.13/10.45  % ...remaining for further processing  : 26
% 0.13/10.45  % Other redundant clauses eliminated   : 0
% 0.13/10.45  % Clauses deleted for lack of memory   : 0
% 0.13/10.45  % Backward-subsumed                    : 0
% 0.13/10.45  % Backward-rewritten                   : 3
% 0.13/10.45  % Generated clauses                    : 268
% 0.13/10.45  % ...of the previous two non-redundant : 94
% 0.13/10.45  % ...aggressively subsumed             : 0
% 0.13/10.45  % Contextual simplify-reflections      : 0
% 0.13/10.45  % Paramodulations                      : 268
% 0.13/10.45  % Factorizations                       : 0
% 0.13/10.45  % NegExts                              : 0
% 0.13/10.45  % Equation resolutions                 : 0
% 0.13/10.45  % Disequality decompositions           : 0
% 0.13/10.45  % Total rewrite steps                  : 847
% 0.13/10.45  % ...of those cached                   : 801
% 0.13/10.45  % Propositional unsat checks           : 0
% 0.13/10.45  %    Propositional check models        : 0
% 0.13/10.45  %    Propositional check unsatisfiable : 0
% 0.13/10.45  %    Propositional clauses             : 0
% 0.13/10.45  %    Propositional clauses after purity: 0
% 0.13/10.45  %    Propositional unsat core size     : 0
% 0.13/10.45  %    Propositional preprocessing time  : 0.000
% 0.13/10.45  %    Propositional encoding time       : 0.000
% 0.13/10.45  %    Propositional solver time         : 0.000
% 0.13/10.45  %    Success case prop preproc time    : 0.000
% 0.13/10.45  %    Success case prop encoding time   : 0.000
% 0.13/10.45  %    Success case prop solver time     : 0.000
% 0.13/10.45  % Current number of processed clauses  : 23
% 0.13/10.45  %    Positive orientable unit clauses  : 20
% 0.13/10.45  %    Positive unorientable unit clauses: 3
% 0.13/10.45  %    Negative unit clauses             : 0
% 0.13/10.45  %    Non-unit-clauses                  : 0
% 0.13/10.45  % Current number of unprocessed clauses: 0
% 0.13/10.45  % ...number of literals in the above   : 0
% 0.13/10.45  % Current number of archived formulas  : 0
% 0.13/10.45  % Current number of archived clauses   : 4
% 0.13/10.45  % Clause-clause subsumption calls (NU) : 0
% 0.13/10.45  % Rec. Clause-clause subsumption calls : 0
% 0.13/10.45  % Non-unit clause-clause subsumptions  : 0
% 0.13/10.45  % Unit Clause-clause subsumption calls : 0
% 0.13/10.45  % Rewrite failures with RHS unbound    : 0
% 0.13/10.45  % BW rewrite match attempts            : 31
% 0.13/10.45  % BW rewrite match successes           : 7
% 0.13/10.45  % Condensation attempts                : 0
% 0.13/10.45  % Condensation successes               : 0
% 0.13/10.45  % Termbank termtop insertions          : 5624
% 0.13/10.45  % Search garbage collected termcells   : 0
% 0.13/10.45  
% 0.13/10.45  % -------------------------------------------------
% 0.13/10.45  % User time                : 0.005 s
% 0.13/10.45  % System time              : 0.004 s
% 0.13/10.45  % Total time               : 0.009 s
% 0.13/10.45  % Maximum resident set size: 3640 pages
% 0.13/10.45  
% 0.13/10.45  % -------------------------------------------------
% 0.13/10.45  % User time                : 0.023 s
% 0.13/10.45  % System time              : 0.015 s
% 0.13/10.45  % Total time               : 0.038 s
% 0.13/10.45  % Maximum resident set size: 4864 pages
% 0.13/10.45  % E exiting
%------------------------------------------------------------------------------