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