TSTP Solution File: SWW436-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWW436-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n023.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 : 600s
% DateTime : Thu Jul 21 00:12:57 EDT 2022
% Result : Unsatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW436-1 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 5 10:51:39 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.14/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.14/0.37 #
% 0.14/0.37 # Number of axioms: 20 Number of unprocessed: 20
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 20 beginning clauses after preprocessing and clausification
% 0.14/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.14/0.37 # Creating start rules for all 1 conjectures.
% 0.14/0.37 # There are 1 start rule candidates:
% 0.14/0.37 # Found 13 unit axioms.
% 0.14/0.37 # 1 start rule tableaux created.
% 0.14/0.37 # 8 extension rule candidate clauses
% 0.14/0.37 # 13 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.37 # Creating equality axioms
% 0.14/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.37 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 26 tableaux to operate on
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_33, hypothesis, (x14!=x6)).
% 0.14/0.39 cnf(i_0_34, hypothesis, (x3!=x6)).
% 0.14/0.39 cnf(i_0_35, hypothesis, (x13!=x3)).
% 0.14/0.39 cnf(i_0_36, hypothesis, (x6!=x4)).
% 0.14/0.39 cnf(i_0_37, hypothesis, (x7!=x4)).
% 0.14/0.39 cnf(i_0_38, hypothesis, (x12!=x4)).
% 0.14/0.39 cnf(i_0_39, hypothesis, (x3!=x1)).
% 0.14/0.39 cnf(i_0_40, hypothesis, (x10!=x15)).
% 0.14/0.39 cnf(i_0_23, plain, (sep(lseg(X1,X1),X2)=X2)).
% 0.14/0.39 cnf(i_0_22, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))).
% 0.14/0.39 cnf(i_0_24, plain, (~heap(sep(next(nil,X1),X2)))).
% 0.14/0.39 cnf(i_0_25, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))).
% 0.14/0.39 cnf(i_0_26, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))).
% 0.14/0.39 cnf(i_0_27, plain, (X1=X3|~heap(sep(next(X1,X2),sep(lseg(X1,X3),X4))))).
% 0.14/0.39 cnf(i_0_28, plain, (X1=X3|X1=X2|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))).
% 0.14/0.39 cnf(i_0_30, plain, (heap(sep(lseg(X1,nil),X3))|~heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))))).
% 0.14/0.39 cnf(i_0_29, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))).
% 0.14/0.39 cnf(i_0_31, plain, (heap(sep(lseg(X1,X3),sep(next(X3,X4),X5)))|~heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5)))))).
% 0.14/0.39 cnf(i_0_32, plain, (X3=X4|heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))|~heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5)))))).
% 0.14/0.39 cnf(i_0_41, hypothesis, (heap(sep(lseg(x13,x2),sep(lseg(x4,x9),sep(lseg(x4,x13),sep(lseg(x1,x5),sep(lseg(x1,x6),sep(lseg(x8,x14),sep(lseg(x8,x15),sep(lseg(x8,x1),sep(lseg(x14,x8),sep(lseg(x15,x4),sep(lseg(x2,x15),sep(lseg(x2,x9),sep(lseg(x9,x7),sep(lseg(x9,x6),sep(lseg(x3,x10),sep(lseg(x6,x2),emp))))))))))))))))))).
% 0.14/0.39 cnf(i_0_83, plain, (X6=X6)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 6 steps
% 0.14/0.39 cnf(i_0_33, hypothesis, (x14!=x6), inference(start_rule)).
% 0.14/0.39 cnf(i_0_91, plain, (x14!=x6), inference(extension_rule, [i_0_28])).
% 0.14/0.39 cnf(i_0_126, plain, (x14=x6), inference(closure_rule, [i_0_33])).
% 0.14/0.39 cnf(i_0_128, plain, (~heap(sep(lseg(x14,x6),sep(lseg(x14,x6),X11)))), inference(extension_rule, [i_0_29])).
% 0.14/0.39 cnf(i_0_169, plain, (x14=x6), inference(closure_rule, [i_0_33])).
% 0.14/0.39 cnf(i_0_171, plain, (~heap(sep(next(x14,x6),sep(lseg(x6,x6),sep(lseg(x14,x6),X11))))), inference(etableau_closure_rule, [i_0_171, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_33, hypothesis, (x14!=x6)).
% 0.14/0.39 cnf(i_0_34, hypothesis, (x3!=x6)).
% 0.14/0.39 cnf(i_0_35, hypothesis, (x13!=x3)).
% 0.14/0.39 cnf(i_0_36, hypothesis, (x6!=x4)).
% 0.14/0.39 cnf(i_0_37, hypothesis, (x7!=x4)).
% 0.14/0.39 cnf(i_0_38, hypothesis, (x12!=x4)).
% 0.14/0.39 cnf(i_0_39, hypothesis, (x3!=x1)).
% 0.14/0.39 cnf(i_0_40, hypothesis, (x10!=x15)).
% 0.14/0.39 cnf(i_0_23, plain, (sep(lseg(X1,X1),X2)=X2)).
% 0.14/0.39 cnf(i_0_22, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))).
% 0.14/0.39 cnf(i_0_24, plain, (~heap(sep(next(nil,X1),X2)))).
% 0.14/0.39 cnf(i_0_25, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))).
% 0.14/0.39 cnf(i_0_26, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))).
% 0.14/0.39 cnf(i_0_27, plain, (X1=X3|~heap(sep(next(X1,X2),sep(lseg(X1,X3),X4))))).
% 0.14/0.39 cnf(i_0_28, plain, (X1=X3|X1=X2|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))).
% 0.14/0.39 cnf(i_0_30, plain, (heap(sep(lseg(X1,nil),X3))|~heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))))).
% 0.14/0.39 cnf(i_0_29, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))).
% 0.14/0.39 cnf(i_0_31, plain, (heap(sep(lseg(X1,X3),sep(next(X3,X4),X5)))|~heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5)))))).
% 0.14/0.39 cnf(i_0_32, plain, (X3=X4|heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))|~heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5)))))).
% 0.14/0.39 cnf(i_0_41, hypothesis, (heap(sep(lseg(x13,x2),sep(lseg(x4,x9),sep(lseg(x4,x13),sep(lseg(x1,x5),sep(lseg(x1,x6),sep(lseg(x8,x14),sep(lseg(x8,x15),sep(lseg(x8,x1),sep(lseg(x14,x8),sep(lseg(x15,x4),sep(lseg(x2,x15),sep(lseg(x2,x9),sep(lseg(x9,x7),sep(lseg(x9,x6),sep(lseg(x3,x10),sep(lseg(x6,x2),emp))))))))))))))))))).
% 0.14/0.39 cnf(i_0_83, plain, (X6=X6)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 6 steps
% 0.14/0.39 cnf(i_0_33, hypothesis, (x14!=x6), inference(start_rule)).
% 0.14/0.39 cnf(i_0_91, plain, (x14!=x6), inference(extension_rule, [i_0_28])).
% 0.14/0.39 cnf(i_0_127, plain, (x14=x6), inference(closure_rule, [i_0_33])).
% 0.14/0.39 cnf(i_0_128, plain, (~heap(sep(lseg(x14,x6),sep(lseg(x14,x6),X11)))), inference(extension_rule, [i_0_29])).
% 0.14/0.39 cnf(i_0_169, plain, (x14=x6), inference(closure_rule, [i_0_33])).
% 0.14/0.39 cnf(i_0_171, plain, (~heap(sep(next(x14,x6),sep(lseg(x6,x6),sep(lseg(x14,x6),X11))))), inference(etableau_closure_rule, [i_0_171, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # Child (22667) has found a proof.
% 0.14/0.39
% 0.14/0.39 # Proof search is over...
% 0.14/0.39 # Freeing feature tree
%------------------------------------------------------------------------------