TSTP Solution File: SWW443-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWW443-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 : n024.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:58 EDT 2022
% Result : Unsatisfiable 0.17s 0.37s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWW443-1 : TPTP v8.1.0. Released v5.2.0.
% 0.00/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 5 13:20:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.36 # No SInE strategy applied
% 0.17/0.36 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.17/0.36 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.17/0.36 #
% 0.17/0.36 # Number of axioms: 34 Number of unprocessed: 34
% 0.17/0.36 # Tableaux proof search.
% 0.17/0.36 # APR header successfully linked.
% 0.17/0.36 # Hello from C++
% 0.17/0.36 # The folding up rule is enabled...
% 0.17/0.36 # Local unification is enabled...
% 0.17/0.36 # Any saturation attempts will use folding labels...
% 0.17/0.36 # 34 beginning clauses after preprocessing and clausification
% 0.17/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.17/0.36 # Creating start rules for all 1 conjectures.
% 0.17/0.36 # There are 1 start rule candidates:
% 0.17/0.36 # Found 27 unit axioms.
% 0.17/0.36 # 1 start rule tableaux created.
% 0.17/0.36 # 8 extension rule candidate clauses
% 0.17/0.36 # 27 unit axiom clauses
% 0.17/0.36
% 0.17/0.36 # Requested 8, 32 cores available to the main process.
% 0.17/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.17/0.36 # Creating equality axioms
% 0.17/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.17/0.36 # Returning from population with 40 new_tableaux and 0 remaining starting tableaux.
% 0.17/0.36 # We now have 40 tableaux to operate on
% 0.17/0.37 # There were 1 total branch saturation attempts.
% 0.17/0.37 # There were 0 of these attempts blocked.
% 0.17/0.37 # There were 0 deferred branch saturation attempts.
% 0.17/0.37 # There were 0 free duplicated saturations.
% 0.17/0.37 # There were 1 total successful branch saturations.
% 0.17/0.37 # There were 0 successful branch saturations in interreduction.
% 0.17/0.37 # There were 0 successful branch saturations on the branch.
% 0.17/0.37 # There were 1 successful branch saturations after the branch.
% 0.17/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.37 # Begin clausification derivation
% 0.17/0.37
% 0.17/0.37 # End clausification derivation
% 0.17/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.17/0.37 cnf(i_0_47, hypothesis, (x6!=x13)).
% 0.17/0.37 cnf(i_0_49, hypothesis, (x11!=x13)).
% 0.17/0.37 cnf(i_0_48, hypothesis, (x16!=x11)).
% 0.17/0.37 cnf(i_0_50, hypothesis, (x15!=x11)).
% 0.17/0.37 cnf(i_0_51, hypothesis, (x4!=x3)).
% 0.17/0.37 cnf(i_0_67, hypothesis, (x16!=x5)).
% 0.17/0.37 cnf(i_0_68, hypothesis, (x15!=x5)).
% 0.17/0.37 cnf(i_0_52, hypothesis, (x3!=x5)).
% 0.17/0.37 cnf(i_0_60, hypothesis, (x4!=x18)).
% 0.17/0.37 cnf(i_0_53, hypothesis, (x17!=x18)).
% 0.17/0.37 cnf(i_0_55, hypothesis, (x13!=x2)).
% 0.17/0.37 cnf(i_0_54, hypothesis, (x8!=x2)).
% 0.17/0.37 cnf(i_0_58, hypothesis, (x16!=x14)).
% 0.17/0.37 cnf(i_0_57, hypothesis, (x14!=x18)).
% 0.17/0.37 cnf(i_0_56, hypothesis, (x14!=x2)).
% 0.17/0.37 cnf(i_0_59, hypothesis, (x9!=x8)).
% 0.17/0.37 cnf(i_0_66, hypothesis, (x19!=x13)).
% 0.17/0.37 cnf(i_0_61, hypothesis, (x19!=x4)).
% 0.17/0.37 cnf(i_0_62, hypothesis, (x6!=x1)).
% 0.17/0.37 cnf(i_0_63, hypothesis, (x13!=x1)).
% 0.17/0.37 cnf(i_0_64, hypothesis, (x15!=x1)).
% 0.17/0.37 cnf(i_0_65, hypothesis, (x14!=x1)).
% 0.17/0.37 cnf(i_0_37, plain, (sep(lseg(X1,X1),X2)=X2)).
% 0.17/0.37 cnf(i_0_36, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))).
% 0.17/0.37 cnf(i_0_38, plain, (~heap(sep(next(nil,X1),X2)))).
% 0.17/0.37 cnf(i_0_39, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))).
% 0.17/0.37 cnf(i_0_40, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))).
% 0.17/0.37 cnf(i_0_41, plain, (X1=X3|~heap(sep(next(X1,X2),sep(lseg(X1,X3),X4))))).
% 0.17/0.37 cnf(i_0_42, plain, (X1=X3|X1=X2|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))).
% 0.17/0.37 cnf(i_0_44, plain, (heap(sep(lseg(X1,nil),X3))|~heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))))).
% 0.17/0.37 cnf(i_0_43, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))).
% 0.17/0.37 cnf(i_0_45, 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.17/0.37 cnf(i_0_46, 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.17/0.37 cnf(i_0_69, hypothesis, (heap(sep(lseg(x10,x1),sep(lseg(x18,x15),sep(lseg(x1,x14),sep(lseg(x1,x3),sep(lseg(x12,x13),sep(lseg(x2,x5),sep(lseg(x2,x12),sep(lseg(x2,x18),sep(lseg(x2,x8),sep(lseg(x9,x5),sep(lseg(x7,x5),sep(lseg(x11,x9),sep(lseg(x11,x7),emp)))))))))))))))).
% 0.17/0.37 cnf(i_0_111, plain, (X6=X6)).
% 0.17/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.17/0.37 # Begin printing tableau
% 0.17/0.37 # Found 6 steps
% 0.17/0.37 cnf(i_0_47, hypothesis, (x6!=x13), inference(start_rule)).
% 0.17/0.37 cnf(i_0_119, plain, (x6!=x13), inference(extension_rule, [i_0_42])).
% 0.17/0.37 cnf(i_0_169, plain, (x6=x13), inference(closure_rule, [i_0_47])).
% 0.17/0.37 cnf(i_0_170, plain, (~heap(sep(lseg(x6,x13),sep(lseg(x6,x13),X11)))), inference(extension_rule, [i_0_43])).
% 0.17/0.37 cnf(i_0_211, plain, (x6=x13), inference(closure_rule, [i_0_47])).
% 0.17/0.37 cnf(i_0_213, plain, (~heap(sep(next(x6,x13),sep(lseg(x13,x13),sep(lseg(x6,x13),X11))))), inference(etableau_closure_rule, [i_0_213, ...])).
% 0.17/0.37 # End printing tableau
% 0.17/0.37 # SZS output end
% 0.17/0.37 # Branches closed with saturation will be marked with an "s"
% 0.17/0.38 # Child (19639) has found a proof.
% 0.17/0.38
% 0.17/0.38 # Proof search is over...
% 0.17/0.38 # Freeing feature tree
%------------------------------------------------------------------------------