TSTP Solution File: LCL407-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL407-2 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:24:48 EDT 2023
% Result : Satisfiable 0.20s 0.53s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named axiom_8)
% 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,axiom,
xor(X1,falsehood) = X1,
axiom_2,
[final] ).
cnf(c_0_10,plain,
xor(truth,xor(truth,X1)) = xor(falsehood,X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]),
[final] ).
cnf(c_0_11,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_12,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_9]),c_0_7]),c_0_10]),
[final] ).
cnf(c_0_13,axiom,
and_star(xor(truth,X1),X1) = falsehood,
axiom_6,
[final] ).
cnf(c_0_15,axiom,
and_star(X1,falsehood) = falsehood,
axiom_5,
[final] ).
cnf(c_0_16,plain,
and_star(xor(truth,X1),xor(falsehood,X1)) = falsehood,
inference(spm,[status(thm)],[c_0_13,c_0_12]),
[final] ).
cnf(c_0_17,plain,
xor(falsehood,truth) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_8]),c_0_9]),
[final] ).
cnf(c_0_18,plain,
and_star(xor(and_star(xor(falsehood,X1),X2),truth),X2) = and_star(xor(and_star(xor(truth,X2),xor(truth,X1)),truth),xor(truth,X1)),
inference(spm,[status(thm)],[c_0_11,c_0_10]),
[final] ).
cnf(c_0_19,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_14,c_0_14]),c_0_12]),
[final] ).
cnf(c_0_20,plain,
and_star(xor(and_star(truth,X1),truth),X1) = falsehood,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_9]),
[final] ).
cnf(c_0_21,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_11,c_0_16]),c_0_17]),c_0_12]),c_0_13]),c_0_17]),
[final] ).
cnf(c_0_22,axiom,
and_star(X1,truth) = X1,
axiom_4,
[final] ).
cnf(c_0_23,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_18,c_0_10]),
[final] ).
cnf(c_0_24,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_19,c_0_10]),
[final] ).
cnf(c_0_25,plain,
and_star(xor(and_star(truth,X1),truth),xor(falsehood,X1)) = falsehood,
inference(spm,[status(thm)],[c_0_20,c_0_21]),
[final] ).
cnf(c_0_26,plain,
and_star(xor(falsehood,X1),xor(truth,X1)) = falsehood,
inference(spm,[status(thm)],[c_0_13,c_0_10]),
[final] ).
cnf(c_0_27,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_22,c_0_11]),c_0_8]),c_0_22]),
[final] ).
cnf(c_0_28,plain,
xor(falsehood,xor(truth,X1)) = xor(truth,X1),
inference(spm,[status(thm)],[c_0_7,c_0_17]),
[final] ).
cnf(c_0_29,plain,
xor(xor(falsehood,X1),X1) = falsehood,
inference(spm,[status(thm)],[c_0_8,c_0_12]),
[final] ).
cnf(c_0_30,plain,
xor(X1,xor(truth,xor(X1,truth))) = falsehood,
inference(spm,[status(thm)],[c_0_8,c_0_7]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL407-2 : TPTP v8.1.2. Released v2.5.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 12:47:01 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.51 Running first-order model finding
% 0.20/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.XcQQVfXErJ/E---3.1_21254.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21364 completed with status 1
% 0.20/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.20/0.53 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.53 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.53 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.53 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.20/0.53 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 21368 completed with status 1
% 0.20/0.53 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.20/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.20/0.53 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.20/0.53 # Preprocessing time : 0.001 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # No proof found!
% 0.20/0.53 # SZS status Satisfiable
% 0.20/0.53 # SZS output start Saturation
% See solution above
% 0.20/0.53 # Parsed axioms : 8
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 8
% 0.20/0.53 # Removed in clause preprocessing : 1
% 0.20/0.53 # Initial clauses in saturation : 7
% 0.20/0.53 # Processed clauses : 74
% 0.20/0.53 # ...of these trivial : 18
% 0.20/0.53 # ...subsumed : 25
% 0.20/0.53 # ...remaining for further processing : 31
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 0
% 0.20/0.53 # Backward-rewritten : 1
% 0.20/0.53 # Generated clauses : 216
% 0.20/0.53 # ...of the previous two non-redundant : 72
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 216
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 0
% 0.20/0.53 # Total rewrite steps : 653
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 23
% 0.20/0.53 # Positive orientable unit clauses : 20
% 0.20/0.53 # Positive unorientable unit clauses: 3
% 0.20/0.53 # Negative unit clauses : 0
% 0.20/0.53 # Non-unit-clauses : 0
% 0.20/0.53 # Current number of unprocessed clauses: 0
% 0.20/0.53 # ...number of literals in the above : 0
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 9
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.53 # Non-unit clause-clause subsumptions : 0
% 0.20/0.53 # Unit Clause-clause subsumption calls : 0
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 24
% 0.20/0.53 # BW rewrite match successes : 4
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 4527
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.006 s
% 0.20/0.53 # System time : 0.001 s
% 0.20/0.53 # Total time : 0.007 s
% 0.20/0.53 # Maximum resident set size: 1520 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.021 s
% 0.20/0.53 # System time : 0.009 s
% 0.20/0.53 # Total time : 0.029 s
% 0.20/0.53 # Maximum resident set size: 1672 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------